354 search results - page 25 / 71 » The Chromatic Number Of Graph Powers |
DCG
2008
14 years 9 months ago
2008
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...
CPC
2007
14 years 9 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
DM
2011
14 years 4 months ago
2011
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted ...
RSA
2011
14 years 4 months ago
2011
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...
DAM
2010
14 years 9 months ago
2010
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...