7,904 research outputs found
Coloring problems in graph theory
In this thesis, we focus on variants of the coloring problem on graphs. A coloring of a graph is an assignment of colors to the vertices. A coloring is proper if no two adjacent vertices are assigned the same color. Colorings are a central part of graph theory and over time many variants of proper colorings have been introduced. The variants we study are packing colorings, improper colorings, and facial unique-maximum colorings.
A packing coloring of a graph is an assignment of colors to the vertices of such that the distance between any two vertices that receive color is greater than . A -coloring of is an assignment of colors to the vertices of such that the distance between any two vertices that receive color is greater than . We study packing colorings of multi-layer hexagonal lattices, improving a result of Fiala, Klav\v{z}ar, and Lidick\\u27{y}, and find the packing chromatic number of the truncated square lattice. We also prove that subcubic planar graphs are -colorable.
A facial unique-maximum coloring of is an assignment of colors to the vertices of such that no two adjacent vertices receive the same color and the maximum color on a face appears only once on that face. We disprove a conjecture of Fabrici and G\ {o}ring that plane graphs are facial unique-maximum -colorable. Inspired by this result, we also provide sufficient conditions for the facial unique-maximum -colorability of a plane graph.
A -coloring of is an assignment of colors and to the vertices of such that the vertices that receive color form an independent set and the vertices that receive color form a linear forest. We will explore -colorings, an offshoot of improper colorings, and prove that subcubic planar -free graphs are -colorable. This result is a corollary of a theorem by Borodin, Kostochka, and Toft, a fact that we failed to realize before the completion of our proof
Acyclic edge-coloring using entropy compression
An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G
and every cycle contains at least three colors. We prove that every graph with
maximum degree Delta has an acyclic edge-coloring with at most 4 Delta - 4
colors, improving the previous bound of 9.62 (Delta - 1). Our bound results
from the analysis of a very simple randomised procedure using the so-called
entropy compression method. We show that the expected running time of the
procedure is O(mn Delta^2 log Delta), where n and m are the number of vertices
and edges of G. Such a randomised procedure running in expected polynomial time
was only known to exist in the case where at least 16 Delta colors were
available. Our aim here is to make a pedagogic tutorial on how to use these
ideas to analyse a broad range of graph coloring problems. As an application,
also show that every graph with maximum degree Delta has a star coloring with 2
sqrt(2) Delta^{3/2} + Delta colors.Comment: 13 pages, revised versio
Coloring non-crossing strings
For a family of geometric objects in the plane
, define as the least
integer such that the elements of can be colored with
colors, in such a way that any two intersecting objects have distinct
colors. When is a set of pseudo-disks that may only intersect on
their boundaries, and such that any point of the plane is contained in at most
pseudo-disks, it can be proven that
since the problem is equivalent to cyclic coloring of plane graphs. In this
paper, we study the same problem when pseudo-disks are replaced by a family
of pseudo-segments (a.k.a. strings) that do not cross. In other
words, any two strings of are only allowed to "touch" each other.
Such a family is said to be -touching if no point of the plane is contained
in more than elements of . We give bounds on
as a function of , and in particular we show that
-touching segments can be colored with colors. This partially answers
a question of Hlin\v{e}n\'y (1998) on the chromatic number of contact systems
of strings.Comment: 19 pages. A preliminary version of this work appeared in the
proceedings of EuroComb'09 under the title "Coloring a set of touching
strings
- …