Pages that link to "Item:Q2490838"
From MaRDI portal
The following pages link to Dominating sets in \(k\)-majority tournaments. (Q2490838):
Displaying 17 items.
- Domination in transitive colorings of tournaments (Q403357) (← links)
- Efron's coins and the linial arrangement (Q738854) (← links)
- Domination and fractional domination in digraphs (Q1671654) (← links)
- Domination in tournaments (Q1745734) (← links)
- Hereditary classes of graphs: a parametric approach (Q2104934) (← links)
- Orientable domination in product-like graphs (Q2109114) (← links)
- Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs (Q2205125) (← links)
- A proof of the Erdös-Sands-Sauer-Woodrow conjecture (Q2312612) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- VC-dimension and Erdős-Pósa property (Q2515568) (← links)
- Domination in Digraphs (Q3384119) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Maximally Nontransitive Dice (Q4577049) (← links)
- Graph functionality (Q5919068) (← links)
- Ranking graphs through hitting times of Markov chains (Q6074655) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
- Approximating multiobjective optimization problems: how exact can you be? (Q6616269) (← links)
