167 research outputs found
A note on coloring vertex-transitive graphs
We prove bounds on the chromatic number of a vertex-transitive graph
in terms of its clique number and maximum degree . We
conjecture that every vertex-transitive graph satisfies and we
prove results supporting this conjecture. Finally, for vertex-transitive graphs
with we prove the Borodin-Kostochka conjecture, i.e.,
Three-coloring graphs with no induced seven-vertex path II : using a triangle
In this paper, we give a polynomial time algorithm which determines if a
given graph containing a triangle and no induced seven-vertex path is
3-colorable, and gives an explicit coloring if one exists. In previous work, we
gave a polynomial time algorithm for three-coloring triangle-free graphs with
no induced seven-vertex path. Combined, our work shows that three-coloring a
graph with no induced seven-vertex path can be done in polynomial time.Comment: 26 page
List coloring in the absence of a linear forest.
The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. The Listk-Coloring problem requires in addition that every vertex u must receive a color from some given set L(u)⊆{1,…,k}. Let Pn denote the path on n vertices, and G+H and rH the disjoint union of two graphs G and H and r copies of H, respectively. For any two fixed integers k and r, we show that Listk-Coloring can be solved in polynomial time for graphs with no induced rP1+P5, hereby extending the result of Hoàng, Kamiński, Lozin, Sawada and Shu for graphs with no induced P5. Our result is tight; we prove that for any graph H that is a supergraph of P1+P5 with at least 5 edges, already List 5-Coloring is NP-complete for graphs with no induced H
- …