718 search results - page 50 / 144 » Coloring quasi-line graphs |
117
click to vote
DM
2010
14 years 12 months ago
2010
Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if Mad(G) 5 2 , then i(G) + 1; sim...
IPL
2008
14 years 12 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
SIAMDM
2008
14 years 11 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
MICCAI
2006
Springer
16 years 23 days ago
2006
Springer
STOC
2003
ACM
16 years 4 days ago
2003
ACM
