26 research outputs found
Interval total colorings of graphs
A total coloring of a graph is a coloring of its vertices and edges such
that no adjacent vertices, edges, and no incident vertices and edges obtain the
same color. An \emph{interval total -coloring} of a graph is a total
coloring of with colors such that at least one vertex or edge
of is colored by , , and the edges incident to each vertex
together with are colored by consecutive colors, where
is the degree of the vertex in . In this paper we investigate
some properties of interval total colorings. We also determine exact values of
the least and the greatest possible number of colors in such colorings for some
classes of graphs.Comment: 23 pages, 1 figur
Fractional total colourings of graphs of high girth
Reed conjectured that for every epsilon>0 and Delta there exists g such that
the fractional total chromatic number of a graph with maximum degree Delta and
girth at least g is at most Delta+1+epsilon. We prove the conjecture for
Delta=3 and for even Delta>=4 in the following stronger form: For each of these
values of Delta, there exists g such that the fractional total chromatic number
of any graph with maximum degree Delta and girth at least g is equal to
Delta+1
Distributed -Coloring in Sublogarithmic Rounds
We give a new randomized distributed algorithm for -coloring in
the LOCAL model, running in
rounds in a graph of maximum degree~. This implies that the
-coloring problem is easier than the maximal independent set
problem and the maximal matching problem, due to their lower bounds of by Kuhn, Moscibroda, and Wattenhofer [PODC'04].
Our algorithm also extends to list-coloring where the palette of each node
contains colors. We extend the set of distributed symmetry-breaking
techniques by performing a decomposition of graphs into dense and sparse parts