Packing non-zero \(A\)-paths in an undirected model of group labeled graphs

DOI10.1016/j.jctb.2009.05.003zbMath1216.05120OpenAlexW2024891025MaRDI QIDQ965242

Paul Wollan

Publication date: 21 April 2010

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.2009.05.003

zbMATH Keywords

disjoint paths\(A\)-pathsgroup labeled graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (7)

Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ Packing cycles in undirected group-labelled graphs ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups ⋮ Packing \(A\)-paths of length zero modulo a prime ⋮ Packing cycles with modularity constraints ⋮ Packing \(A\)-paths of length zero modulo four ⋮ Erdös--Pósa Property for Labeled Minors: 2-Connected Minors

Cites Work

• Unnamed Item
• 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
• Disjoint \(A\)-paths in digraphs
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen

This page was built for publication: Packing non-zero \(A\)-paths in an undirected model of group labeled graphs