23 search results - page 2 / 5 » Polychromatic colorings of plane graphs |
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
73
Voted
JCT
2006
15 years 10 days ago
2006
125
click to vote
DM
2002
15 years 5 days ago
2002
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
96
Voted
COMBINATORICS
2004
15 years 7 days ago
2004
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
108
click to vote
DAM
2007
15 years 10 days ago
2007
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...