Packing cycles with modularity constraints
From MaRDI portal
Publication:653988
DOI10.1007/s00493-011-2551-5zbMath1249.05215MaRDI QIDQ653988
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
05C38: Paths and cycles
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C22: Signed and weighted graphs
Related Items
Frames, $A$-Paths, and the Erdös--Pósa Property, Erdös--Pósa Property for Labeled Minors: 2-Connected Minors, Unnamed Item, $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property, Packing cycles in undirected group-labelled graphs, On group feedback vertex set parameterized by the size of the cutset, Packing cycles through prescribed vertices under modularity constraints, \(K_4\)-expansions have the edge-Erdős-Pósa property, Finding a path with two labels forbidden in group-labeled graphs, Packing \(A\)-paths of length zero modulo four, Half-integral packing of odd cycles through prescribed vertices, Recent techniques and results on the Erdős-Pósa property, A Faster Parameterized Algorithm for Group Feedback Edge Set
Cites Work
- 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
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
- Highly parity linked graphs
- Mangoes and blueberries
- Graph minors. X: Obstructions to tree-decomposition
- Über die Maximalzahl kreuzungsfreier H-Wege
- Quickly excluding a planar graph
- Non-zero disjoint cycles in highly connected group labelled graphs
- Disjoint \(A\)-paths in digraphs
- On the presence of disjoint subgraphs of a specified type
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- 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 odd cycles in graphs of large connectivity
