Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable

DOI10.1023/A:1009784115916zbMath0914.05031OpenAlexW1575368669MaRDI QIDQ1273432

Wenan Zang

Publication date: 21 June 1999

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009784115916

zbMATH Keywords

Toft's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Bonds with parity constraints ⋮ Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen ⋮ Subdivisions with congruence constraints in digraphs of large chromatic number ⋮ K ₄ -free and C6¯-free Planar Matching Covered Graphs ⋮ Hadwiger’s Conjecture ⋮ Odd-\(K_{4}\)'s in stability critical graphs

This page was built for publication: Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable