Heroes in orientations of chordal graphs
Pierre Aboulker, Guillaume Aubian, Raphael Steiner
TL;DR
This paper characterizes specific digraphs that, when forbidden as induced subgraphs in orientations of chordal graphs, ensure these graphs have a bounded dichromatic number, advancing understanding of graph orientations and coloring.
Contribution
It provides a complete characterization of digraphs H that guarantee bounded dichromatic number in H-free orientations of chordal graphs.
Findings
Identifies all digraphs H with this property.
Establishes conditions for bounded dichromatic number.
Enhances understanding of graph orientations and coloring constraints.
Abstract
We characterize all digraphs such that orientations of chordal graphs with no induced copy of have bounded dichromatic number.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Limits and Structures in Graph Theory