Packing cycles in undirected group-labelled graphs

DOI10.1016/j.jctb.2023.02.011zbMath1512.05353arXiv2009.11266OpenAlexW3088215122MaRDI QIDQ6038589

Youngho Yoo, Robin Thomas

Publication date: 2 May 2023

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.11266

zbMATH Keywords

cyclespackingErdős-Pósa propertygroup-labelled graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Connectivity and tree structure in finite graphs
• Packing cycles with modularity constraints
• Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
• Mangoes and blueberries
• Graph minors. X: Obstructions to tree-decomposition
• Über n-fach zusammenhängende Eckenmengen in Graphen
• Quickly excluding a planar graph
• Graph minors. XIII: The disjoint paths problem
• Packing \(A\)-paths of length zero modulo four
• Recent techniques and results on the Erdős-Pósa property
• A unified Erdős-Pósa theorem for constrained cycles
• On the odd-minor variant of Hadwiger's conjecture
• Excluding a group-labelled graph
• Packing \(A\)-paths of length zero modulo a prime
• On the presence of disjoint subgraphs of a specified type
• Frames, $A$-Paths, and the Erdös--Pósa Property
• $k$-Blocks: A Connectivity Invariant for Graphs
• On Independent Circuits Contained in a Graph
• Improved Bounds for the Flat Wall Theorem

This page was built for publication: Packing cycles in undirected group-labelled graphs