The dichromatic number of digraphs without induced subdigraphs

DOI10.1016/J.DISC.2025.114729MaRDI QIDQ6884420zbMATH OpenFDO

Authors Bin Chen, Xinmin Hou

Publication date 15 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114729

zbMATH Keywords

\(\vec{\chi}\)-boundeddichromatic numberforbidden induced subdigraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites work

• \((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number
• A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
• A survey of -boundedness
• Applications of hypergraph coloring to coloring graphs not inducing certain trees
• Chordal directed graphs are not \(\chi\)-bounded
• Circular colorings of edge-weighted graphs
• Coloring dense digraphs
• Coloring digraphs with forbidden cycles
• Coloring tournaments: from local to global
• Dichromatic number and forced subdivisions
• Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded
• Extension of Gyárfás-Sumner conjecture to digraphs
• Graph Theory and Probability
• Heroes in orientations of chordal graphs
• scientific article; zbMATH DE number 3747156 (Why is no real title available?)
• scientific article; zbMATH DE number 3480625 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Induced subgraphs of graphs with large chromatic number. XI. Orientations
• Induced subgraphs of graphs with large chromatic number. XII. Distant stars
• Induced subgraphs of graphs with large chromatic number. XIII. New brooms
• Induced subtrees in graphs of large chromatic number
• Nombre chromatique et plus longs chemins d'un graphe
• On coloring digraphs with forbidden induced subgraphs
• Planar digraphs of digirth four are 2-colorable
• Polynomial bounds for chromatic number. III. Excluding a double star
• Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P₄
• Radius Three Trees in Graphs with Large Chromatic Number
• Radius two trees specify χ‐bounded classes
• The dichromatic number of a digraph
• Tournaments and colouring
• χ‐bounded families of oriented graphs

This page was built for publication: The dichromatic number of digraphs without induced subdigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884420)