A note on min-max pair in tournaments

DOI10.1007/S00373-019-02062-XMaRDI QIDQ2334076zbMATH OpenOpenAlexWikidataFDO

Authors Xiaoyun 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)

Recommendations

• On min-max pair in tournaments
• scientific article; zbMATH DE number 4089591
• On \(d\)-panconnected tournaments with large semidegrees
• scientific article; zbMATH DE number 3869359
• Publication:4488563

Cites work

• scientific article; zbMATH DE number 1764950 (Why is no real title available?)
• Bypasses in asymmetric digraphs
• Cycles of Each Length in Regular Tournaments
• Hamiltonian-connected tournaments
• On min-max pair in tournaments
• Pancyclic arcs and connectivity in tournaments
• The number of pancyclic arcs in a k‐strong tournament

Cited in

(4)

• Ranking tournaments with no errors. II: Minimax relation
• On min-max pair in tournaments
• scientific article; zbMATH DE number 3869359 (Why is no real title available?)
• On \(d\)-panconnected tournaments with large semidegrees

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

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