Disjoint \(A\)-paths in digraphs
From MaRDI portal
Publication:2565693
DOI10.1016/j.jctb.2005.03.001zbMath1072.05033OpenAlexW4206244388MaRDI QIDQ2565693
Publication date: 28 September 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2005.03.001
Related Items
Frames, $A$-Paths, and the Erdös--Pósa Property, Packing cycles with modularity constraints, Packing \(A\)-paths of length zero modulo four, Packing non-zero \(A\)-paths in an undirected model of group labeled graphs, On the complexity of finding internally vertex-disjoint long directed paths
Cites Work
- Über die Maximalzahl kreuzungsfreier H-Wege
- Über ein graphentheoretisches Problem von T. Gallai
- A short proof of Mader's \(\mathcal S\)-paths theorem
- Über ein graphentheoretisches Ergebnis von T. Gallai
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- The Factorization of Linear Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item