Packing non-zero A-paths in group-labelled graphs
DOI10.1007/S00493-006-0030-1zbMATH Open1127.05050OpenAlexW2159330890MaRDI QIDQ879161FDOQ879161
Authors: Maria Chudnovsky, Jim Geelen, Bert Gerards, Michael Lohman, Paul Seymour, Luis Goddyn 
Publication date: 8 May 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-006-0030-1
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (33)
- Packing \(A\)-paths in group-labelled graphs via linear matroid parity
- Non-zero disjoint cycles in highly connected group labeled graphs
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
- On group feedback vertex set parameterized by the size of the cutset
- FPT algorithms for path-transversal and cycle-transversal problems
- Packing cycles with modularity constraints
- Parameterized Complexity of $$(A,\ell )$$-Path Packing
- Odd Multiway Cut in Directed Acyclic Graphs
- Erdös--Pósa Property for Labeled Minors: 2-Connected Minors
- Disjoint non-balanced \(A\)-paths in biased graphs
- Finding a path with two labels forbidden in group-labeled graphs
- Search-space reduction via essential vertices
- A Weighted Linear Matroid Parity Algorithm
- Packing non-zero \(A\)-paths via matroid matching
- Tree metrics and edge-disjoint \(S\)-paths
- Non-zero disjoint cycles in highly connected group labelled graphs
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
- Parameterized complexity of \((A,\ell)\)-path packing
- Half-integrality, LP-branching, and FPT algorithms
- On the odd-minor variant of Hadwiger's conjecture
- Euler Digraphs
- Frames, $A$-Paths, and the Erdös--Pósa Property
- Odd Multiway Cut in Directed Acyclic Graphs
- Excluding a group-labelled graph
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
- Packing \(A\)-paths of length zero modulo a prime
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
- Recent techniques and results on the Erdős-Pósa property
- Packings and 2-packings of A-paths
- Note on coloring graphs without odd-\(K_k\)-minors
- Packing non-returning A-paths
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs
- Packing non-returning \(A\)-paths algorithmically
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)
