1302 search results - page 8 / 261 » On the Strong Chromatic Number |
JCT
2007
14 years 9 months ago
2007
JGT
2010
14 years 8 months ago
2010
: We consider a problem related to Hadwiger’s Conjecture. Let
DM
2006
14 years 9 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...
102
click to vote
DM
2000
14 years 9 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...
APAL
2011
14 years 4 months ago
2011
Abstract. We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic numbe...