We prove a decomposition theorem for the class of triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. We prove that every graph of girth at least five in this class is 3-colorable
AbstractAll K4-free graphs with no odd hole and no odd antihole are three-colourable, but what about...
Let G be a plane graph of girth at least five. We show that if there exists a 3-coloring of a cycle ...
4 pages - v2 corrected typosLet $K_4^+$ be the 5-vertex graph obtained from $K_4$, the complete grap...
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivisio...
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivisio...
International audienceWe show that triangle-free graphs that do not contain an induced subgraph isom...
This is the peer reviewed version of the following article: Chudnovsky, M., Liu, C.-H., Schaudt, O.,...
AbstractWe prove a decomposition theorem for graphs that do not contain a subdivision of K4 as an in...
The chromatic number of a triangle-free graph can be arbitrarily large. In this article, we show tha...
International audienceWe prove a decomposition theorem for graphs that do not contain a subdivision ...
URL des Documents de travail : https://centredeconomiesorbonne.cnrs.fr/publications/Documents de tra...
AbstractWe show that the question “Is a graph 3-colorable?” remains NP-complete when restricted to t...
The chromatic number of a triangle-free graph can be arbitrarily large. In this article, we show tha...
All K4-free graphs with no odd hole and no odd antihole are three-colourable, but what about K4-free...
AbstractIn the course of extending Grötzsch’s Theorem, we prove that every triangle-free graph witho...
AbstractAll K4-free graphs with no odd hole and no odd antihole are three-colourable, but what about...
Let G be a plane graph of girth at least five. We show that if there exists a 3-coloring of a cycle ...
4 pages - v2 corrected typosLet $K_4^+$ be the 5-vertex graph obtained from $K_4$, the complete grap...
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivisio...
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivisio...
International audienceWe show that triangle-free graphs that do not contain an induced subgraph isom...
This is the peer reviewed version of the following article: Chudnovsky, M., Liu, C.-H., Schaudt, O.,...
AbstractWe prove a decomposition theorem for graphs that do not contain a subdivision of K4 as an in...
The chromatic number of a triangle-free graph can be arbitrarily large. In this article, we show tha...
International audienceWe prove a decomposition theorem for graphs that do not contain a subdivision ...
URL des Documents de travail : https://centredeconomiesorbonne.cnrs.fr/publications/Documents de tra...
AbstractWe show that the question “Is a graph 3-colorable?” remains NP-complete when restricted to t...
The chromatic number of a triangle-free graph can be arbitrarily large. In this article, we show tha...
All K4-free graphs with no odd hole and no odd antihole are three-colourable, but what about K4-free...
AbstractIn the course of extending Grötzsch’s Theorem, we prove that every triangle-free graph witho...
AbstractAll K4-free graphs with no odd hole and no odd antihole are three-colourable, but what about...
Let G be a plane graph of girth at least five. We show that if there exists a 3-coloring of a cycle ...
4 pages - v2 corrected typosLet $K_4^+$ be the 5-vertex graph obtained from $K_4$, the complete grap...
DOI
Add to ORKG