Path numbers of tournaments

DOI10.1016/0095-8956(76)90013-7zbMath0293.05127OpenAlexW2029958837MaRDI QIDQ1212011

David W. Mason, Brian Alspach, Norman J. Pullman

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(76)90013-7

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Partitions of digraphs into paths or circuits ⋮ Path covering problems and testing of printed circuits ⋮ Path decompositions of tournaments ⋮ Decomposing tournaments into paths ⋮ An upper bound on the path number of a digraph ⋮ Covering digraphs by paths ⋮ Brian Alspach and his work

Cites Work

• Path decompositions of digraphs
• Unnamed Item

This page was built for publication: Path numbers of tournaments