Coloring dense digraphs

DOI10.1007/S00493-019-3815-8MaRDI QIDQ5919339zbMATH OpenOpenAlexWikidataFDO

Authors Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé

Publication date 17 January 2020

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-019-3815-8

zbMATH Keywords

coloringdigraphherosuperhero

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42)

Recommendations

• Coloring dense digraphs
• Coloring Graphs with Dense Neighborhoods
• Coloring and covering nowhere dense graphs
• The complexity of colouring problems on dense graphs
• Colouring and covering nowhere dense graphs
• On DP‐coloring of digraphs
• Coloring digraphs with forbidden cycles
• Set colorings of digraphs
• Colorings in digraphs from the spectral radius
• \(H\)-colorings of dense hypergraphs

Cited in

(13)

• Tournaments and colouring
• Extension of Gyárfás-Sumner conjecture to digraphs
• Set colorings of digraphs
• Heroes in orientations of chordal graphs
• Strong complete minors in digraphs
• Coloring dense digraphs
• Complete directed minors and chromatic number
• Four proofs of the directed Brooks' theorem
• Heroes in oriented complete multipartite graphs
• Coloring tournaments with few colors: algorithms and complexity
• On heroes in digraphs with forbidden induced forests
• \((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number
• The dichromatic number of digraphs without induced subdigraphs

This page was built for publication: Coloring dense digraphs

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