383 search results - page 4 / 77 » A Bound on the Total Chromatic Number |
COLOGNETWENTE
2009
15 years 23 days ago
2009
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...
65
Voted
DM
2006
14 years 11 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
ANTS
2008
Springer
15 years 1 months ago
2008
Springer
We enumerate all totally real number fields F with root discriminant F 14. There are 1229 such fields, each with degree [F : Q] 9. In this article, we consider the following prob...
73
Voted
COMBINATORICS
2007
14 years 11 months ago
2007
