Packing cycles with modularity constraints

DOI10.1007/S00493-011-2551-5MaRDI QIDQ653988zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

packingdisjoint cyclesAbelian groupmodularity constraintsErdős-Pósa property

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38)

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

Cites work

• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• Covering Theorems for Ordered Sets
• Disjoint A-paths in digraphs
• Graph minors. X: Obstructions to tree-decomposition
• Highly parity linked graphs
• Mangoes and blueberries
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• Non-zero disjoint cycles in highly connected group labelled graphs
• On the presence of disjoint subgraphs of a specified type
• Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
• Packing non-zero \(A\)-paths in group-labelled graphs
• Quickly excluding a planar graph
• The Erdős-Pósa property for odd cycles in graphs of large connectivity
• 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
• Über die Maximalzahl kreuzungsfreier H-Wege

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
• Packing cycles through prescribed vertices under modularity constraints
• A faster parameterized algorithm for Group Feedback Edge Set
• Non-zero disjoint cycles in highly connected group labelled graphs
• A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
• \(K_4\)-expansions have the edge-Erdős-Pósa property
• Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
• 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)