An H-free graph is a graph that does not contain H as an induced subgraph. We say that a graph G is k-critical H-free if G is H-free, k-chromatic, and every H- ...

Apr 27, 2015 · We prove that there are 24 4-critical P_6-free graphs, and give the complete list. We remark that, if H is connected and not a subgraph of P_6, there are ...

Let G be a graph with a maximal tripod T such that no vertex of G has neighbors in all three classes of T. Let G0 be the graph obtained from G by contracting T.

We prove that there are 24 4-critical $P_6$-free graphs, and give the complete list. We remark that, if $H$ is connected and not a subgraph of $P_6$, ...

We prove that there are 24 4-critical P 6-free graphs, and give the complete list. We remark that, if H is connected and not a subgraph of P 6, ...

We prove that there are 24 4-critical P6-free graphs, and give the complete list. We remark that, if H is connected and not a subgraph of P6, ...

This work surveys known results on the computational complexity of Coloring and k‐Coloring for graph classes that are characterized by one or two forbidden ...

The complexity of coloring graphs without long induced paths is a notorious problem in algorithmic graph theory, an especially intruiging case being that of ...

We prove that there are 24 4-critical P 6 P_6 -free graphs, and give the complete list. We remark that, if H H is connected and not a subgraph of P 6 P_6 ...

Obstructions for three-coloring graphs without induced paths on six vertices. Author: Chudnovsky, Maria. Goedgebeur, Jan ; Schaudt, Oliver ; Zhong, Mingxian ...