A note on min-max pair in tournaments

DOI10.1007/S00373-019-02062-XzbMath1426.05056OpenAlexW2963076871WikidataQ127445755 ScholiaQ127445755MaRDI QIDQ2334076

Xiao-Yun Lu

Publication date: 6 November 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02062-x

zbMATH Keywords

Hamiltonian cyclestournamentsHamiltonian pathspancyclic tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On \(d\)-panconnected tournaments with large semidegrees

Cites Work

• Unnamed Item
• Hamiltonian-connected tournaments
• On min-max pair in tournaments
• Bypasses in asymmetric digraphs
• Pancyclic arcs and connectivity in tournaments
• Cycles of Each Length in Regular Tournaments
• The number of pancyclic arcs in a k‐strong tournament

This page was built for publication: A note on min-max pair in tournaments