Duran G.

G. Duran

Information about the author G. Duran will soon be added to the site.
Found 2 papers in total
On a conjecture concerning Helly circle graphs
2003
We say that G is an e-circle graph if there is a bijection between its vertices and...
Computational complexity of classical problems for hereditary clique-Helly graphs
2004
A graph is clique-Helly when its cliques satisfy the Helly property. A graph is...
Papers per page: