Decomposing and colouring some locally semicomplete digraphs

DOI10.1016/j.ejc.2022.103591zbMath1497.05064OpenAlexW3136561314MaRDI QIDQ2674564

Guillaume Aubian, Pierre Aboulker, Pierre Charbit

Publication date: 14 September 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2022.103591

zbMATH Keywords

dichromatic number of a digraphnice sets

Mathematics Subject Classification ID

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

Related Items (5)

Heroes in Orientations of Chordal Graphs ⋮ On coloring digraphs with forbidden induced subgraphs ⋮ 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edge density of critical digraphs
• The strong perfect graph theorem
• A classification of locally semicomplete digraphs
• The dichromatic number of a digraph
• A note on coloring digraphs of large girth
• Extension of Gyárfás-Sumner conjecture to digraphs
• Dichromatic number and forced subdivisions
• The minimum number of edges in 4-critical digraphs of given order
• Subdivisions in digraphs of large out-degree or large dichromatic number
• Forcing large transitive subtournaments
• A flow theory for the dichromatic number
• On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs
• Locally semicomplete digraphs: A generalization of tournaments
• A sufficient condition for a digraph to be positive-round
• Kings in locally semicomplete digraphs
• Classes of Directed Graphs
• List coloring digraphs
• Planar Digraphs of Digirth Four are 2-Colorable

This page was built for publication: Decomposing and colouring some locally semicomplete digraphs