An upper bound on the path number of a digraph

DOI10.1016/0095-8956(77)90009-0zbMath0354.05036OpenAlexW2126256582MaRDI QIDQ1236547

Richard C. O'Brien

Publication date: 1977

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(77)90009-0

Mathematics Subject Classification ID

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

Related Items (6)

Partitions of digraphs into paths or circuits ⋮ Path decompositions of tournaments ⋮ Decomposing tournaments into paths ⋮ Covering digraphs by paths ⋮ Path decompositions of digraphs ⋮ Decompositions of digraphs into paths and cycles

Cites Work

• Path numbers of tournaments
• Path decompositions of digraphs

This page was built for publication: An upper bound on the path number of a digraph