Bypaths in tournaments

DOI10.1016/S0166-218X(97)00038-3zbMath0882.05080MaRDI QIDQ1372736

Yubao Guo, Lutz Volkmann

Publication date: 1 February 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

tournamentbypathpan-connectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian-connected tournaments
• Completely strong path-connected tournaments
• Cycles of each length in tournaments
• Bypasses in asymmetric digraphs
• Cycles of Each Length in Regular Tournaments

This page was built for publication: Bypaths in tournaments