Partitions of digraphs into paths or circuits

DOI10.1016/0012-365X(86)90106-8zbMath0605.05016MaRDI QIDQ1084110

Henri Meyniel, Wojciech Bienia

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

pathscircuitsgraph decompositionarc partition

Mathematics Subject Classification ID

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

Related Items (4)

What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? ⋮ Long cycles, heavy cycles and cycle decompositions in digraphs ⋮ Path and cycle decompositions of dense graphs ⋮ Decompositions of digraphs into paths and cycles

Cites Work

• Path numbers of tournaments
• An upper bound on the path number of a digraph
• Path decompositions of digraphs
• Unnamed Item

This page was built for publication: Partitions of digraphs into paths or circuits