Sciweavers

22 search results - page 3 / 5
» Clique and chromatic number of circular-perfect graphs
Sort
View
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
13 years 11 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
IPL
2007
94views more  IPL 2007»
13 years 6 months ago
A note on the Hadwiger number of circular arc graphs
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chan...
DCG
2008
82views more  DCG 2008»
13 years 7 months ago
Visibility Graphs of Point Sets in the Plane
The visibility graph V(X) of a discrete point set X R2 has vertex set X and an edge xy for every two points x, y X whenever there is no other point in X on the line segment betw...
Florian Pfender
RSA
2011
89views more  RSA 2011»
13 years 2 months ago
Excluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
József Balogh, Jane Butterfield
DM
2006
124views more  DM 2006»
13 years 7 months ago
Hall ratio of the Mycielski graphs
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
Mathew Cropper, András Gyárfá...