4298 search results - page 7 / 860 » Measurable chromatic numbers |
DM
1998
13 years 7 months ago
1998
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...
JCT
2007
13 years 7 months ago
2007
JGT
2010
13 years 5 months ago
2010
: We consider a problem related to Hadwiger’s Conjecture. Let
DM
2006
13 years 7 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
DM
2000
13 years 7 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...