Bispindles in strongly connected digraphs with large chromatic number

zbMath1388.05077MaRDI QIDQ1640212

Nathann Cohen, Frédéric Havet, Raul Lopes, William Lochet

Publication date: 14 June 2018

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p39

zbMATH Keywords

digraphchromatic numbersubdivisions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paths with two blocks in \(n\)-chromatic digraphs
• Oriented trees in digraphs
• Subdivisions in digraphs of large out-degree or large dichromatic number
• Graph Theory and Probability
• Antidirected Subtrees of Directed Graphs
• Diconnected Orientations and a Conjecture of Las Vergnas
• Cycles with two blocks in k‐chromatic digraphs
• Subdivisions of oriented cycles in digraphs with large chromatic number
• Nombre chromatique et plus longs chemins d'un graphe
• Zur algebraischen Begründung der Graphentheorie. I

This page was built for publication: Bispindles in strongly connected digraphs with large chromatic number