Non-zero disjoint cycles in highly connected group labelled graphs

DOI10.1016/j.jctb.2005.08.001zbMath1090.05038OpenAlexW1984537627MaRDI QIDQ2490257

Ken-ichi Kawarabayashi, Paul Wollan

Publication date: 28 April 2006

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

zbMATH Keywords

Erdős-Pósa propertygroup labelled graphnon-zero cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph minors (05C83) Connectivity (05C40)

Related Items (16)

A Faster Parameterized Algorithm for Group Feedback Edge Set ⋮ On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture ⋮ The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Finding a path with two labels forbidden in group-labeled graphs ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ Synchronization problems in computer vision with closed-form solutions ⋮ FPT algorithms for path-transversal and cycle-transversal problems ⋮ Packing cycles with modularity constraints ⋮ Half-integrality, LP-branching, and FPT Algorithms ⋮ Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs ⋮ Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs ⋮ Packing Cycles Faster Than Erdos--Posa ⋮ On group feedback vertex set parameterized by the size of the cutset

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces
• Packing non-zero \(A\)-paths in group-labelled graphs
• Highly parity linked graphs
• Linear connectivity forces large complete bipartite minors
• Mangoes and blueberries
• An improved linear edge bound for graph linkages
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Highly linked graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• On the presence of disjoint subgraphs of a specified type
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
• The Erdős-Pósa property for odd cycles in highly connected graphs
• The Erdős-Pósa property for odd cycles in graphs of large connectivity

This page was built for publication: Non-zero disjoint cycles in highly connected group labelled graphs