354 search results - page 12 / 71 » The Chromatic Number Of Graph Powers |
83
Voted
WG
2004
Springer
15 years 5 months ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
100
Voted
ALGORITHMICA
2004
14 years 11 months 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...
79
Voted
DM
2008
14 years 11 months 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)...
86
Voted
EJC
2008
14 years 11 months 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 ...
75
Voted
DM
2000
14 years 11 months ago
2000
For integers p; q; s with p