Bypaths in tournaments

DOI10.1016/S0166-218X(97)00038-3zbMATH Open0882.05080MaRDI QIDQ1372736FDOQ1372736

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamiltonian-connected tournaments
• Cycles of Each Length in Regular Tournaments
• Bypasses in asymmetric digraphs
• Completely strong path-connected tournaments
• Cycles of each length in tournaments

Cited In (1)

• Paths with many shortcuts in tournaments

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Paths and Cycles in Tournaments 👍 👎
• Parity of paths in tournaments 👍 👎
• Decomposing tournaments into paths 👍 👎
• Paths with many shortcuts in tournaments 👍 👎
• Decomposing tournaments into paths 👍 👎
• Paths of given length in tournaments 👍 👎

This page was built for publication: Bypaths in tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372736)