Packing disjoint cycles over vertex cuts
From MaRDI portal
Publication:973127
DOI10.1016/j.disc.2010.03.009zbMath1222.05121OpenAlexW2017724661MaRDI QIDQ973127
Ingo Schiermeyer, Peter Recht, Jochen Harant, Eva-Maria Sprengel, Dieter Rautenbach
Publication date: 28 May 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00017416/IfM_Preprint_M_09_17.pdf
Related Items (4)
Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Maximum cycle packing in Eulerian graphs using local traces ⋮ Packing Euler graphs with traces ⋮ Maximum cycle packing using SPR-trees
Cites Work
- Unnamed Item
- Unnamed Item
- Independence number and vertex-disjoint cycles
- Packing edge-disjoint cycles in graphs and the cyclomatic number
- On packing shortest cycles in graphs
- On the existence of disjoint cycles in a graph
- Packing cycles in graphs
- Vertex-disjoint cycles of the same length.
- Covering vertices of a graph by \(k\) disjoint cycles
- On integrality, stability and composition of dicycle packings and covers
- Large vertex-disjoint cycles in a bipartite graph
- Packing triangles in bounded degree graphs.
- Vertex-disjoint cycles containing specified edges
- Linear time solvable optimization problems on graphs of bounded clique-width
- Maximal total length of \(k\) disjoint cycles in bitpartite graphs
- Recent Results on Disjoint Cycles in Graphs
- Disjoint Cycles: Integrality Gap, Hardness, and Approximation
- Graph minors. II. Algorithmic aspects of tree-width
- The NP-Completeness of Some Edge-Partition Problems
- A Note on Vertex-Disjoint Cycles
- Handbook of Graph Grammars and Computing by Graph Transformation
- Packing cycles in undirected graphs
- Approximation algorithms and hardness results for cycle packing problems
- On Independent Circuits Contained in a Graph
- Approximability of Packing Disjoint Cycles
- On Edge-Disjoint Cycles in a Graph
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
- On the maximal number of independent circuits in a graph
- On independent cycles in a bipartite graph
This page was built for publication: Packing disjoint cycles over vertex cuts
