Bispindle in strongly connected digraphs with large chromatic number

DOI10.1016/j.endm.2017.10.013zbMath1383.05128arXiv1703.02230OpenAlexW2954827967MaRDI QIDQ2413152

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

Publication date: 9 April 2018

Full work available at URL: https://arxiv.org/abs/1703.02230

zbMATH Keywords

digraphsubdivisionchromatic number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Oriented trees in digraphs
• 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
• On chromatic number of graphs and set-systems
• Nombre chromatique et plus longs chemins d'un graphe
• Zur algebraischen Begründung der Graphentheorie. I

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