Sciweavers

174 search results - page 12 / 35
» On the First-Fit Chromatic Number of Graphs
Sort
View
ALGORITHMICA
2004
150views more  ALGORITHMICA 2004»
13 years 7 months ago
Sum Coloring of Bipartite Graphs with Bounded Degree
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
Michal Malafiejski, Krzysztof Giaro, Robert Jancze...
DM
2008
112views more  DM 2008»
13 years 7 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
13 years 7 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»
13 years 7 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...
CPC
2010
89views more  CPC 2010»
13 years 7 months ago
The t-Improper Chromatic Number of Random Graphs
Ross J. Kang, Colin McDiarmid