Path decompositions of digraphs

DOI10.1017/S0004972700041101zbMath0273.05117OpenAlexW2157741071MaRDI QIDQ5181723

Brian Alspach, Norman J. Pullman

Publication date: 1974

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700041101

Mathematics Subject Classification ID

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

Related Items (10)

Partitions of digraphs into paths or circuits ⋮ Path covering problems and testing of printed circuits ⋮ Walks, partitions, and normal ordering ⋮ Path decompositions of tournaments ⋮ Decomposing tournaments into paths ⋮ Path numbers of tournaments ⋮ An upper bound on the path number of a digraph ⋮ Covering digraphs by paths ⋮ Brian Alspach and his work ⋮ NP-completeness of some problems of partitioning and covering in graphs

This page was built for publication: Path decompositions of digraphs