762 search results - page 52 / 153 » Strategic Coloring of a Graph |
133
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
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 4 and mad(G) < 14 5 , then i(G...
181
click to vote
DM
2010
15 years 6 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...
130
click to vote
IPL
2008
15 years 6 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...
146
click to vote
SIAMDM
2008
15 years 6 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...