217 search results - page 2 / 44 » A new upper bound on the cyclic chromatic number |
ENDM
2006
13 years 5 months ago
2006
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
ICANNGA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
COLOGNETWENTE
2009
13 years 6 months ago
2009
GD
2005
Springer
13 years 11 months ago
2005
Springer
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
IWOCA
2009
Springer
13 years 12 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...