Chordal directed graphs are not \(\chi\)-bounded

DOI10.37236/11050zbMath1493.05130arXiv2202.01006OpenAlexW4229027250MaRDI QIDQ2138574

Nicolas Bousquet, Rémi de Joannis de Verclos, Pierre Aboulker

Publication date: 12 May 2022

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

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

zbMATH Keywords

dichromatic numberchordal digraphdicoloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Heroes in Orientations of Chordal Graphs ⋮ Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) ⋮ Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded ⋮ A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number

Cites Work

• The dichromatic number of a digraph
• Extension of Gyárfás-Sumner conjecture to digraphs
• A survey of χ‐boundedness
• Unnamed Item
• Unnamed Item

This page was built for publication: Chordal directed graphs are not \(\chi\)-bounded