On min-max pair in tournaments

DOI10.1007/S00373-018-1899-3zbMATH Open1395.05099OpenAlexW2805141822MaRDI QIDQ2413628FDOQ2413628

Xiaoyun Lu

Publication date: 14 September 2018

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

Full work available at URL: https://doi.org/10.1007/s00373-018-1899-3

zbMATH Keywords

Hamiltonian pathtournamentmin-max pair

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Hamiltonian-connected tournaments

Cited In (4)

• A note on min-max pair in tournaments
• Minimal stable sets in tournaments
• Title not available (Why is that?)
• On king-serf pair in tournaments

This page was built for publication: 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 Q2413628)