Packing non-zero \(A\)-paths in group-labelled graphs

DOI10.1007/s00493-006-0030-1zbMath1127.05050OpenAlexW2159330890MaRDI QIDQ879161

Michael Lohman, Jim Geelen, Bert Gerards, P. D. Seymour, Maria Chudnovsky, Luis A. 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

zbMATH Keywords

group-labelled graphspacking non-zero paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (31)

Parameterized Complexity of $$(A,\ell )$$-Path Packing ⋮ Odd Multiway Cut in Directed Acyclic Graphs ⋮ Packing non-zero \(A\)-paths via matroid matching ⋮ A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor ⋮ Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Finding a path with two labels forbidden in group-labeled graphs ⋮ All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs ⋮ FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs ⋮ Packing \(A\)-paths of length zero modulo a prime ⋮ FPT algorithms for path-transversal and cycle-transversal problems ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ Packing cycles with modularity constraints ⋮ Odd Multiway Cut in Directed Acyclic Graphs ⋮ A Weighted Linear Matroid Parity Algorithm ⋮ An algorithm for packing non-zero \(A\)-paths in group-labelled graphs ⋮ Packing non-returning \(A\)-paths algorithmically ⋮ Packing non-zero \(A\)-paths in an undirected model of group labeled graphs ⋮ Non-zero disjoint cycles in highly connected group labelled graphs ⋮ Disjoint non-balanced \(A\)-paths in biased graphs ⋮ Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity ⋮ On the odd-minor variant of Hadwiger's conjecture ⋮ Excluding a group-labelled graph ⋮ Half-integrality, LP-branching, and FPT Algorithms ⋮ Note on coloring graphs without odd-\(K_k\)-minors ⋮ Erdös--Pósa Property for Labeled Minors: 2-Connected Minors ⋮ Euler Digraphs ⋮ Non-zero disjoint cycles in highly connected group labeled graphs ⋮ Packings and 2-packings of A-paths ⋮ Parameterized complexity of \((A,\ell)\)-path packing ⋮ On group feedback vertex set parameterized by the size of the cutset

This page was built for publication: Packing non-zero \(A\)-paths in group-labelled graphs