Total domination and the Caccetta-Häggkvist conjecture

DOI10.1016/j.disopt.2012.07.004zbMath1254.90281WikidataQ123196085 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

zbMATH Keywords

dominating sets; Caccetta-Häggkvist conjecture; smallest circuit

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C27: Combinatorial optimization

Related Items

On a class of graphs between threshold and total domishold graphs, Domination in Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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