Subdivisions of four blocks cycles in digraphs with large chromatic number
From MaRDI portal
Publication:2235256
DOI10.1016/j.dam.2021.08.005zbMath1476.05064OpenAlexW3200626120MaRDI QIDQ2235256
Publication date: 21 October 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.08.005
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Paths with two blocks in \(n\)-chromatic digraphs
- Graphs with \(k\) odd cycle lengths
- Cycle lengths and chromatic number of graphs
- Oriented trees in digraphs
- Cycle length parities and the chromatic number
- Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable
- Graph Theory and Probability
- Structure and Coloring of Graphs with Only Small Odd Cycles
- Diconnected Orientations and a Conjecture of Las Vergnas
- Subdivisions of oriented cycles in digraphs with large chromatic number
- On chromatic number of graphs and set-systems
- Nombre chromatique et plus longs chemins d'un graphe
This page was built for publication: Subdivisions of four blocks cycles in digraphs with large chromatic number