An upper bound on the path number of a digraph
From MaRDI portal
Publication:1236547
DOI10.1016/0095-8956(77)90009-0zbMath0354.05036OpenAlexW2126256582MaRDI QIDQ1236547
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
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
This page was built for publication: An upper bound on the path number of a digraph