Packing paths in digraphs

DOI10.1002/jgt.10126zbMath1033.05079OpenAlexW4242581432MaRDI QIDQ4432768

Richard C. Brewster, Sarah H. Pantel, Anders Yeo, Romeo Rizzi, Pavol Hell

Publication date: 29 October 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10126

zbMATH Keywords

min-max theoremgraph packinggood characterizationaugmenting configuration

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Packing $k$-Matchings and $k$-Critical Graphs ⋮ Oriented star packings ⋮ On the complexity of finding internally vertex-disjoint long directed paths

Cites Work

• Paths, Trees, and Flowers
• Unnamed Item

This page was built for publication: Packing paths in digraphs