30 search results - page 3 / 6 » Distinguishing Chromatic Number of Cartesian Products of Gra... |
APPML
2011
13 years 5 days ago
2011
Zykov designed one of the oldest known family of triangle-free graphs with arbitrarily high chromatic number. We determine the fractional chromatic number of the Zykov product of ...
DM
2008
13 years 5 months ago
2008
For graphs G and H, let G H denote their Cartesian sum. This paper investigates the chromatic number and the circular chromatic number for GH. It is proved that (G H) max{ c(G)...
DM
2008
13 years 5 months ago
2008
JGT
2008
13 years 5 months ago
2008
DM
2008
13 years 5 months ago
2008
A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interval between the vertices of S. The size of a minimum geodetic set in G is the geo...