Disjoint non-balanced \(A\)-paths in biased graphs
From MaRDI portal
Publication:2020032
DOI10.1016/j.aam.2020.102014zbMath1462.05297OpenAlexW3008931396MaRDI QIDQ2020032
Publication date: 23 April 2021
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2020.102014
Cites Work
- Biased graphs. I: Bias, balance, and gains
- Packing non-zero \(A\)-paths in group-labelled graphs
- Über die Maximalzahl kreuzungsfreier H-Wege
- A short proof of Mader's \(\mathcal S\)-paths theorem
- Packing non-returning A-paths
- Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
This page was built for publication: Disjoint non-balanced \(A\)-paths in biased graphs