On coloring digraphs with forbidden induced subgraphs

DOI10.1002/jgt.22920zbMath1522.05142arXiv2103.04191OpenAlexW3134168121MaRDI QIDQ6074583

No author found.

Publication date: 12 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringinduced subgraphsdirected graphsGyárfás-Sumner conjecture

Mathematics Subject Classification ID

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

Related Items (3)

Four proofs of the directed Brooks' theorem ⋮ Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) ⋮ Heroes in oriented complete multipartite graphs

Cites Work

• Induced subgraphs of graphs with large chromatic number. XI. Orientations
• The dichromatic number of a digraph
• Tournaments and colouring
• Extension of Gyárfás-Sumner conjecture to digraphs
• Decomposing and colouring some locally semicomplete digraphs
• Classes of Directed Graphs
• A survey of χ‐boundedness
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On coloring digraphs with forbidden induced subgraphs