The Hoàng-Reed conjecture for \(\delta ^{+}=3\)

DOI10.1016/j.disc.2010.03.001zbMath1222.05091OpenAlexW1983534642WikidataQ122964674 ScholiaQ122964674MaRDI QIDQ973119

Manuel Welhan

Publication date: 28 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.001

zbMATH Keywords

separatorCaccetta-Häggkvistcircuit-forestHoáng-Reedminimum out-degree

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Tournaments and Semicomplete Digraphs

Cites Work

• A note on short cycles in digraphs
• Disjoint cycles in digraphs
• Hoàng-Reed conjecture holds for tournaments
• The 2-linkage problem for acyclic digraphs
• Even cycles in directed graphs
• A note on minimal directed graphs with given girth
• Cycles in digraphs– a survey
• Unnamed Item
• Unnamed Item

This page was built for publication: The Hoàng-Reed conjecture for \(\delta ^{+}=3\)