For a number $l\geq 2$, let ${\cal{G}}_l$ denote the family of graphs which have girth $2l+1$ and have no odd hole with length greater than $2l+1$. Wu, Xu and Xu conjectured that every graph in $\bigcup_{l\geq 2} {\cal{G}}_{l}$ is $3$-colorable. Chudnovsky et al., Wu et al., and Chen showed that every graph in ${\cal{G}}_2$, ${\cal{G}}_3$ and $\bigcup_{l\geq 5} {\cal{G}}_{l}$ is $3$-colorable respectively. In this paper, we prove that every graph in ${\cal{G}}_4$ is $3$-colorable. This confirms Wu, Xu and Xu's conjecture.Comment: arXiv admin note: substantial text overlap with arXiv:2210.12376, arXiv:2301.00112 by other author
For a graph $G$, $\chi(G)$ $(\omega(G))$ denote its chromatic (clique) number. A $P_5$ is the chordl...
AbstractAll K4-free graphs with no odd hole and no odd antihole are three-colourable, but what about...
This is the peer reviewed version of the following article: Chudnovsky, M., Liu, C.-H., Schaudt, O.,...
We say that a graph $G$ has an {\em odd $K_4$-subdivision} if some subgraph of $G$ is isomorphic to ...
An odd hole is an induced odd cycle of length at least 5. Scott and Seymour confirmed a conjecture o...
Classical vertex coloring problems ask for the minimum number of colors needed to color the vertices...
For an integer k≥1, a graph G is k-colorable if there exists a mapping c:VG→{1,…,k} such that c(u)≠c...
The girth of a graph G is the length of a shortest cycle in G. For any fixed girth g ≥ 4 we determin...
AbstractWe give a short proof of the result that every planar graph of girth 5 is 3-choosable and he...
AbstractWe prove that every graph of girth at least five which admits an embedding in the Klein bott...
AbstractIt is known that every triangle-free (equivalently, of girth at least 4) circle graph is 5-c...
A hole is an induced cycle of length at least 4. A graph is called a pentagraph if it has no cycles ...
AbstractA graph G is (k+1)-critical if it is not k-colourable but G−e is k-colourable for any edge e...
AbstractIn this note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
Let $\mathscr{G}$ be the class of plane graphs without triangles normally adjacent to $8^{-}$-cycles...
For a graph $G$, $\chi(G)$ $(\omega(G))$ denote its chromatic (clique) number. A $P_5$ is the chordl...
AbstractAll K4-free graphs with no odd hole and no odd antihole are three-colourable, but what about...
This is the peer reviewed version of the following article: Chudnovsky, M., Liu, C.-H., Schaudt, O.,...
We say that a graph $G$ has an {\em odd $K_4$-subdivision} if some subgraph of $G$ is isomorphic to ...
An odd hole is an induced odd cycle of length at least 5. Scott and Seymour confirmed a conjecture o...
Classical vertex coloring problems ask for the minimum number of colors needed to color the vertices...
For an integer k≥1, a graph G is k-colorable if there exists a mapping c:VG→{1,…,k} such that c(u)≠c...
The girth of a graph G is the length of a shortest cycle in G. For any fixed girth g ≥ 4 we determin...
AbstractWe give a short proof of the result that every planar graph of girth 5 is 3-choosable and he...
AbstractWe prove that every graph of girth at least five which admits an embedding in the Klein bott...
AbstractIt is known that every triangle-free (equivalently, of girth at least 4) circle graph is 5-c...
A hole is an induced cycle of length at least 4. A graph is called a pentagraph if it has no cycles ...
AbstractA graph G is (k+1)-critical if it is not k-colourable but G−e is k-colourable for any edge e...
AbstractIn this note, it is proved that every plane graph without 5- and 7-cycles and without adjace...
Let $\mathscr{G}$ be the class of plane graphs without triangles normally adjacent to $8^{-}$-cycles...
For a graph $G$, $\chi(G)$ $(\omega(G))$ denote its chromatic (clique) number. A $P_5$ is the chordl...
AbstractAll K4-free graphs with no odd hole and no odd antihole are three-colourable, but what about...
This is the peer reviewed version of the following article: Chudnovsky, M., Liu, C.-H., Schaudt, O.,...