174 search results - page 12 / 35 » On the First-Fit Chromatic Number of Graphs |
111
Voted
ALGORITHMICA
2004
15 years 9 days ago
2004
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...
DM
2008
15 years 14 days ago
2008
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)...
90
Voted
EJC
2008
15 years 14 days ago
2008
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 ...
82
Voted
DM
2000
15 years 7 days ago
2000
For integers p; q; s with p
CPC
2010
15 years 15 days ago
2010
