Packing non-zero A-paths in group-labelled graphs
From MaRDI portal
Recommendations
Cited in
(31)- Tree metrics and edge-disjoint \(S\)-paths
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
- Packing \(A\)-paths in group-labelled graphs via linear matroid parity
- Parameterized complexity of \((A,\ell)\)-path packing
- Parameterized Complexity of $$(A,\ell )$$-Path Packing
- All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
- On the odd-minor variant of Hadwiger's conjecture
- Odd multiway cut in directed acyclic graphs
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
- Note on coloring graphs without odd-\(K_k\)-minors
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
- Packing non-returning \(A\)-paths algorithmically
- Search-space reduction via essential vertices
- FPT algorithms for path-transversal and cycle-transversal problems
- Recent techniques and results on the Erdős-Pósa property
- Disjoint non-balanced \(A\)-paths in biased graphs
- Excluding a group-labelled graph
- A weighted linear matroid parity algorithm
- Packing non-zero \(A\)-paths via matroid matching
- Packings and 2-packings of A-paths
- Non-zero disjoint cycles in highly connected group labelled graphs
- Packing cycles with modularity constraints
- Non-zero disjoint cycles in highly connected group labeled graphs
- Erdős-Pósa property for labeled minors: 2-connected minors
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
- Frames, \(A\)-paths, and the Erdős-Pósa property
- Half-integrality, LP-branching, and FPT algorithms
- Odd Multiway Cut in Directed Acyclic Graphs
- Packing \(A\)-paths of length zero modulo a prime
- Packing non-returning A-paths
- Euler digraphs
This page was built for publication: Packing non-zero \(A\)-paths in group-labelled graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879161)
