Domination and fractional domination in digraphs
From MaRDI portal
Publication:1671654
zbMath1395.05069arXiv1708.00423MaRDI QIDQ1671654
Alantha Newman, Tien-Nam Le, Ararat Harutyunyan, Steéphan Thomassé
Publication date: 7 September 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.00423
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Directed domination in oriented hypergraphs ⋮ Domination in Digraphs ⋮ A proof of the Erdös-Sands-Sauer-Woodrow conjecture ⋮ Orientable domination in product-like graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination in transitive colorings of tournaments
- On finding a minimum dominating set in a tournament
- Domination in tournaments
- A proof of the Erdös-Sands-Sauer-Woodrow conjecture
- Coloring tournaments: from local to global
- Dominating sets in \(k\)-majority tournaments.
- Gallai colorings and domination in multipartite digraphs
- Coloring dense digraphs
- Graph colouring and the probabilistic method
This page was built for publication: Domination and fractional domination in digraphs