Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz

DOI10.1155/2012/273416zbMath1236.05095OpenAlexW1980220163WikidataQ58703349 ScholiaQ58703349MaRDI QIDQ666527

Nicolas Lichiardopol

Publication date: 8 March 2012

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/273416

zbMATH Keywords

minimum outdegreeregular tournament of degree \(d\)strongly connected subtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

Finding good 2-partitions of digraphs. I. Hereditary properties ⋮ Finding good 2-partitions of digraphs. II. Enumerable properties ⋮ On the parameterized complexity of 2-partitions ⋮ Partition and disjoint cycles in digraphs ⋮ On splitting digraphs ⋮ Degree constrained 2-partitions of semicomplete digraphs ⋮ On 1-factors with prescribed lengths in tournaments ⋮ Tournaments and Semicomplete Digraphs ⋮ Highly linked tournaments with large minimum out-degree

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
• Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
• Splitting digraphs

This page was built for publication: Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz