Totally odd \(K_4\)-subdivisions in 4-chromatic graphs

DOI10.1007/s004930100006zbMath1012.05064OpenAlexW2065300109WikidataQ56926749 ScholiaQ56926749MaRDI QIDQ5955212

Carsten Thomassen

Publication date: 13 February 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930100006

zbMATH Keywords

4-chromatic graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Acyclic subgraphs with high chromatic number ⋮ 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 ⋮ Tight bounds for divisible subdivisions ⋮ K ₄ -free and C6¯-free Planar Matching Covered Graphs ⋮ Hadwiger’s Conjecture ⋮ Every orientation of a 4-chromatic graph has a non-bipartite acyclic subgraph ⋮ Odd-\(K_{4}\)'s in stability critical graphs ⋮ Fixed-parameter tractability for subset feedback set problems with parity constraints

This page was built for publication: Totally odd \(K_4\)-subdivisions in 4-chromatic graphs