266 research outputs found
Normal 6-edge-colorings of some bridgeless cubic graphs
In an edge-coloring of a cubic graph, an edge is poor or rich, if the set of
colors assigned to the edge and the four edges adjacent it, has exactly five or
exactly three distinct colors, respectively. An edge is normal in an
edge-coloring if it is rich or poor in this coloring. A normal
-edge-coloring of a cubic graph is an edge-coloring with colors such
that each edge of the graph is normal. We denote by the smallest
, for which admits a normal -edge-coloring. Normal edge-colorings
were introduced by Jaeger in order to study his well-known Petersen Coloring
Conjecture. It is known that proving for every bridgeless
cubic graph is equivalent to proving Petersen Coloring Conjecture. Moreover,
Jaeger was able to show that it implies classical conjectures like Cycle Double
Cover Conjecture and Berge-Fulkerson Conjecture. Recently, two of the authors
were able to show that any simple cubic graph admits a normal
-edge-coloring, and this result is best possible. In the present paper, we
show that any claw-free bridgeless cubic graph, permutation snark, tree-like
snark admits a normal -edge-coloring. Finally, we show that any bridgeless
cubic graph admits a -edge-coloring such that at least edges of are normal.Comment: 17 pages, 11 figures. arXiv admin note: text overlap with
arXiv:1804.0944
Parameterized Complexity of Equitable Coloring
A graph on vertices is equitably -colorable if it is -colorable and
every color is used either or times.
Such a problem appears to be considerably harder than vertex coloring, being
even for cographs and interval graphs.
In this work, we prove that it is for block
graphs and for disjoint union of split graphs when parameterized by the number
of colors; and for -free interval graphs
when parameterized by treewidth, number of colors and maximum degree,
generalizing a result by Fellows et al. (2014) through a much simpler
reduction.
Using a previous result due to Dominique de Werra (1985), we establish a
dichotomy for the complexity of equitable coloring of chordal graphs based on
the size of the largest induced star.
Finally, we show that \textsc{equitable coloring} is when
parameterized by the treewidth of the complement graph
Complexity of Grundy coloring and its variants
The Grundy number of a graph is the maximum number of colors used by the
greedy coloring algorithm over all vertex orderings. In this paper, we study
the computational complexity of GRUNDY COLORING, the problem of determining
whether a given graph has Grundy number at least . We also study the
variants WEAK GRUNDY COLORING (where the coloring is not necessarily proper)
and CONNECTED GRUNDY COLORING (where at each step of the greedy coloring
algorithm, the subgraph induced by the colored vertices must be connected).
We show that GRUNDY COLORING can be solved in time and WEAK
GRUNDY COLORING in time on graphs of order . While GRUNDY
COLORING and WEAK GRUNDY COLORING are known to be solvable in time
for graphs of treewidth (where is the number of
colors), we prove that under the Exponential Time Hypothesis (ETH), they cannot
be solved in time . We also describe an
algorithm for WEAK GRUNDY COLORING, which is therefore
\fpt for the parameter . Moreover, under the ETH, we prove that such a
running time is essentially optimal (this lower bound also holds for GRUNDY
COLORING). Although we do not know whether GRUNDY COLORING is in \fpt, we
show that this is the case for graphs belonging to a number of standard graph
classes including chordal graphs, claw-free graphs, and graphs excluding a
fixed minor. We also describe a quasi-polynomial time algorithm for GRUNDY
COLORING and WEAK GRUNDY COLORING on apex-minor graphs. In stark contrast with
the two other problems, we show that CONNECTED GRUNDY COLORING is
\np-complete already for colors.Comment: 24 pages, 7 figures. This version contains some new results and
improvements. A short paper based on version v2 appeared in COCOON'1
The Complexity of Rerouting Shortest Paths
The Shortest Path Reconfiguration problem has as input a graph G (with unit
edge lengths) with vertices s and t, and two shortest st-paths P and Q. The
question is whether there exists a sequence of shortest st-paths that starts
with P and ends with Q, such that subsequent paths differ in only one vertex.
This is called a rerouting sequence.
This problem is shown to be PSPACE-complete. For claw-free graphs and chordal
graphs, it is shown that the problem can be solved in polynomial time, and that
shortest rerouting sequences have linear length. For these classes, it is also
shown that deciding whether a rerouting sequence exists between all pairs of
shortest st-paths can be done in polynomial time. Finally, a polynomial time
algorithm for counting the number of isolated paths is given.Comment: The results on claw-free graphs, chordal graphs and isolated paths
have been added in version 2 (april 2012). Version 1 (September 2010) only
contained the PSPACE-hardness result. (Version 2 has been submitted.
- …