AbstractWe show that the question “Is a graph 3-colorable?” remains NP-complete when restricted to the class of triangle-free graphs with maximum degree 4. Likewise the question “Is a triangle-free graph k-colorable?” is shown to be NP-complete for any fixed value of k ⩾ 4
We study the computational complexity of the vertex 3-colorability problem in the class of claw-free...
The VERTEX COLOURING problem is known to be NP-complete in the class of triangle-free graphs. Moreov...
AbstractThe k-Coloring problem is to test whether a graph can be colored with at most k colors such ...
AbstractWe show that the question “Is a graph 3-colorable?” remains NP-complete when restricted to t...
We give a new proof showing that it is NP-hard to color a 3-colorable graph using just four colors. ...
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize...
AbstractIn this paper, we study a chromatic aspect for the class of P6-free graphs. Here, the focus ...
We give a new proof showing that it is NP-hard to color a 3-colorable graph using just four colors. ...
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivisio...
We discuss the computational complexity of determining the chromatic number of graphs without long i...
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey y...
AbstractIt is shown that two sorts of problems belong to the NP-complete class. First, it is proven ...
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey y...
Although deciding whether the vertices of a planar graph can be colored with three colors is NP-hard...
This is the peer reviewed version of the following article: Chudnovsky, M., Liu, C.-H., Schaudt, O.,...
We study the computational complexity of the vertex 3-colorability problem in the class of claw-free...
The VERTEX COLOURING problem is known to be NP-complete in the class of triangle-free graphs. Moreov...
AbstractThe k-Coloring problem is to test whether a graph can be colored with at most k colors such ...
AbstractWe show that the question “Is a graph 3-colorable?” remains NP-complete when restricted to t...
We give a new proof showing that it is NP-hard to color a 3-colorable graph using just four colors. ...
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize...
AbstractIn this paper, we study a chromatic aspect for the class of P6-free graphs. Here, the focus ...
We give a new proof showing that it is NP-hard to color a 3-colorable graph using just four colors. ...
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivisio...
We discuss the computational complexity of determining the chromatic number of graphs without long i...
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey y...
AbstractIt is shown that two sorts of problems belong to the NP-complete class. First, it is proven ...
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey y...
Although deciding whether the vertices of a planar graph can be colored with three colors is NP-hard...
This is the peer reviewed version of the following article: Chudnovsky, M., Liu, C.-H., Schaudt, O.,...
We study the computational complexity of the vertex 3-colorability problem in the class of claw-free...
The VERTEX COLOURING problem is known to be NP-complete in the class of triangle-free graphs. Moreov...
AbstractThe k-Coloring problem is to test whether a graph can be colored with at most k colors such ...
DOI
Add to ORKG