Coloring dense digraphs

DOI10.1016/j.endm.2017.07.010zbMath1379.05035arXiv1704.07219OpenAlexW2608581057MaRDI QIDQ5915818

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

Publication date: 18 January 2018

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

digraph coloringErdős-Hajnal conjecturechromatic number of digraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42)

Related Items (1)

Domination and fractional domination in digraphs

Cites Work

• Tournaments with near-linear transitive subsets
• Domination in tournaments
• Tournaments and colouring
• Coloring tournaments: from local to global
• The Erdös-Hajnal Conjecture-A Survey

This page was built for publication: Coloring dense digraphs