Dominating sets in \(k\)-majority tournaments.

DOI10.1016/j.jcta.2005.05.009zbMath1094.05040OpenAlexW2066869387MaRDI QIDQ2490838

Noga Alon, Graham R. Brightwell, Henry A. Kierstead, Alexandr V. Kostochka, Peter M. Winkler

Publication date: 18 May 2006

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2005.05.009

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (16)

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension ⋮ Domination and fractional domination in digraphs ⋮ Maximally Nontransitive Dice ⋮ Domination in transitive colorings of tournaments ⋮ Ranking graphs through hitting times of Markov chains ⋮ On the kernel and related problems in interval digraphs ⋮ Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs ⋮ Domination in tournaments ⋮ VC-dimension and Erdős-Pósa property ⋮ Efron's coins and the linial arrangement ⋮ Graph functionality ⋮ Domination in Digraphs ⋮ A proof of the Erdös-Sands-Sauer-Woodrow conjecture ⋮ \(k\)-majority digraphs and the hardness of voting with a constant number of voters ⋮ Hereditary classes of graphs: a parametric approach ⋮ Orientable domination in product-like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dominating sets in \(k\)-majority tournaments.