Triangle-free \(2P_3\)-free graphs are 4-colorable

DOI10.1016/j.disc.2012.10.019zbMath1259.05066OpenAlexW2022488583MaRDI QIDQ1939592

Artem V. Pyatkin

Publication date: 4 March 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.10.019

zbMATH Keywords

chromatic numbertriangle-free graphvertex coloring\(2P_{3}\)-free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

On the chromatic number of (\(P_6\), diamond)-free graphs ⋮ Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs ⋮ Coloring (\(P_5\), kite)-free graphs with small cliques ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ $(2P_2,K_4)$-Free Graphs are 4-Colorable

This page was built for publication: Triangle-free \(2P_3\)-free graphs are 4-colorable