174 search results - page 16 / 35 » On the First-Fit Chromatic Number of Graphs |
94
Voted
CORR
2008
Springer
15 years 14 days ago
2008
Springer
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
104
Voted
FSTTCS
2000
Springer
15 years 4 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
70
Voted
COMBINATORICS
2006
15 years 13 days ago
2006
We prove the following extension of an old result of Andr
JCT
2008
15 years 11 days ago
2008
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
106
Voted
DAM
2010
15 years 14 days ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...