The partition of a strong tournament

DOI10.1016/j.disc.2004.10.011zbMath1069.05037OpenAlexW2014512309MaRDI QIDQ1772417

Hao Li, Jin-Long Shu

Publication date: 18 April 2005

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

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

zbMATH Keywords

almost transitive tournament

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Complementary cycles in regular bipartite tournaments ⋮ Complementary cycles of any length in regular bipartite tournaments ⋮ Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture ⋮ Minimum cycle factors in quasi-transitive digraphs ⋮ Multipartite tournaments: a survey ⋮ Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree ⋮ Cycle factors in strongly connected local tournaments ⋮ Finding complementary cycles in locally semicomplete digraphs ⋮ Degree constrained 2-partitions of semicomplete digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Two proofs of Bermond-Thomassen conjecture for regular tournaments

Cites Work

• Complementary cycles of all lengths in tournaments
• Partitioning vertices of a tournament into independent cycles
• Unnamed Item
• Unnamed Item

This page was built for publication: The partition of a strong tournament