Sciweavers

617 search results - page 14 / 124
» On the Chromatic Number of Random Graphs
Sort
View
DM
2008
112views more  DM 2008»
14 years 11 months ago
Coloring the Cartesian sum of graphs
For graphs G and H, let G H denote their Cartesian sum. This paper investigates the chromatic number and the circular chromatic number for GH. It is proved that (G H) max{ c(G)...
Daphne Der-Fen Liu, Xuding Zhu
EJC
2008
14 years 11 months 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
DM
2000
99views more  DM 2000»
14 years 11 months 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...
DM
2010
109views more  DM 2010»
14 years 11 months ago
The thickness and chromatic number of r-inflated graphs
Michael O. Albertson, Debra L. Boutin, Ellen Gethn...
DM
2008
53views more  DM 2008»
14 years 11 months ago
Distance graphs with maximum chromatic number
Javier Barajas, Oriol Serra