Sciweavers

284 search results - page 12 / 57
» On the adaptable chromatic number of graphs
Sort
View
91
Voted
EJC
2008
15 years 15 days ago
Fractional chromatic number of distance graphs generated by two-interval sets
Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z, D), has the set Z of all integers as the vertex Supported in part by the National Science ...
Daphne Der-Fen Liu, Xuding Zhu
82
Voted
DM
2000
99views more  DM 2000»
15 years 8 days ago
Chromatically unique bipartite graphs with low 3-independent partition numbers
For integers p; q; s with p
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles...
70
Voted
CPC
2010
89views more  CPC 2010»
15 years 16 days ago
The t-Improper Chromatic Number of Random Graphs
Ross J. Kang, Colin McDiarmid
63
Voted
CPC
2008
67views more  CPC 2008»
15 years 16 days ago
On the Strong Chromatic Number of Random Graphs
Po-Shen Loh, Benny Sudakov
64
Voted
DM
2010
109views more  DM 2010»
15 years 16 days ago
The thickness and chromatic number of r-inflated graphs
Michael O. Albertson, Debra L. Boutin, Ellen Gethn...