Subdivisions of oriented cycles in digraphs with large chromatic number
From MaRDI portal
Publication:4646948
DOI10.1002/jgt.22360zbMath1484.05083arXiv1605.07762OpenAlexW2963205193MaRDI QIDQ4646948
Frédéric Havet, Nathann Cohen, Nicolas Nisse, William Lochet
Publication date: 3 January 2019
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.07762
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (10)
Bispindles in strongly connected digraphs with large chromatic number ⋮ Bispindle in strongly connected digraphs with large chromatic number ⋮ Existence of paths with \(t\) blocks in \(k ( t )\)-chromatic digraph ⋮ Subdivisions of four blocks cycles in digraphs with large chromatic number ⋮ On the complexity of finding internally vertex-disjoint long directed paths ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ Dichromatic number and forced subdivisions ⋮ On three blocks paths \(P (k, l, r)\) ⋮ Tournaments and Semicomplete Digraphs ⋮ Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number
This page was built for publication: Subdivisions of oriented cycles in digraphs with large chromatic number
