Total domination and the Caccetta-Häggkvist conjecture
From MaRDI portal
Publication:1926487
DOI10.1016/j.disopt.2012.07.004zbMath1254.90281OpenAlexW2088470271WikidataQ123196085 ScholiaQ123196085MaRDI QIDQ1926487
Bernard Gendron, Patrick St-Louis, Alain Hertz
Publication date: 28 December 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2012.07.004
Related Items (2)
Cites Work
- A note on short cycles in digraphs
- Short cycles in directed graphs
- A new upper bound on the total domination number of a graph
- A note on minimal directed graphs with given girth
- Short cycles in digraphs
- Fractional dominations and fractional total dominations of graph complements
- On the Caccetta-Häggkvist conjecture
- On the girth of digraphs
- The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
- Total domination in graphs
- Graphs with large total domination number
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Total domination and the Caccetta-Häggkvist conjecture