Packing cycles with modularity constraints
From MaRDI portal
Publication:653988
DOI10.1007/S00493-011-2551-5zbMATH Open1249.05215OpenAlexW2013023265MaRDI QIDQ653988FDOQ653988
Authors: Paul Wollan 
Publication date: 20 December 2011
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-011-2551-5
Recommendations
- Packing cycles in undirected group-labelled graphs
- Packing cycles through prescribed vertices under modularity constraints
- Non-zero disjoint cycles in highly connected group labelled graphs
- scientific article; zbMATH DE number 617590
- On the size of graphs whose cycles have length divisible by a fixed integer
Signed and weighted graphs (05C22) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38)
Cites Work
- Graph minors. X: Obstructions to tree-decomposition
- Non-zero disjoint cycles in highly connected group labelled graphs
- Packing non-zero \(A\)-paths in group-labelled graphs
- Mangoes and blueberries
- Quickly excluding a planar graph
- Highly parity linked graphs
- Title not available (Why is that?)
- Über die Maximalzahl kreuzungsfreier H-Wege
- The Erdős-Pósa property for odd cycles in graphs of large connectivity
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- On the presence of disjoint subgraphs of a specified type
- Disjoint \(A\)-paths in digraphs
- Covering Theorems for Ordered Sets
- The Erdős-Pósa property for odd cycles in highly connected graphs
- The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
Cited In (13)
- Packing cycles in undirected group-labelled graphs
- Frames, \(A\)-paths, and the Erdős-Pósa property
- \(K_4\)-subdivisions have the edge-Erdős-Pósa property
- Packing \(A\)-paths of length zero modulo four
- A faster parameterized algorithm for Group Feedback Edge Set
- Packing cycles through prescribed vertices under modularity constraints
- A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
- Non-zero disjoint cycles in highly connected group labelled graphs
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- \(K_4\)-expansions have the edge-Erdős-Pósa property
- Erdős-Pósa property for labeled minors: 2-connected minors
- Half-integral packing of odd cycles through prescribed vertices
- Recent techniques and results on the Erdős-Pósa property
This page was built for publication: Packing cycles with modularity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653988)
