Every orientation of a 4-chromatic graph has a non-bipartite acyclic subgraph

DOI10.37236/10727zbMath1481.05054OpenAlexW4210611567MaRDI QIDQ2073290

Asaf Shapira

Publication date: 1 February 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/10727

zbMATH Keywords

chromatic numbergraph orientation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Acyclic subgraphs with high chromatic number
• Oriented trees in digraphs
• Acyclic subgraphs of tournaments with high chromatic number
• On the structure of 5- and 6-chromatic abstract graphs.
• Totally odd \(K_4\)-subdivisions in 4-chromatic graphs

This page was built for publication: Every orientation of a 4-chromatic graph has a non-bipartite acyclic subgraph