Packing disjoint cycles over vertex cuts
type: Item
instance of: scholarly article
title: Packing disjoint cycles over vertex cuts
zbMATH Open document ID: 1222.05121
author: Jochen Harant
author: Peter Recht
author: Ingo Schiermeyer
author: Eva-Maria Sprengel
author: Dieter Rautenbach
published in: Discrete Mathematics
publication date: 2010-05-28T00:00:00Z
full work available at URL: IfM Preprint M 09 17.pdf
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5713525
zbMATH Keywords: connectivity
zbMATH Keywords: cycle
zbMATH Keywords: edge-disjoint cycles
zbMATH Keywords: graph
zbMATH Keywords: packings of cycles
zbMATH Keywords: vertex cut
zbMATH Keywords: vertex-disjoint cycles
MaRDI profile type: Publication
OpenAlex ID: W2017724661
cites work: Packing cycles in undirected graphs
cites work: Packing triangles in bounded degree graphs.
cites work: On the maximal number of independent circuits in a graph
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Packing cycles in graphs
cites work: Independence number and vertex-disjoint cycles
cites work: Vertex-disjoint cycles containing specified edges
cites work: Covering vertices of a graph by \(k\) disjoint cycles
cites work: On the existence of disjoint cycles in a graph
cites work: Q5342984
cites work: On Independent Circuits Contained in a Graph
cites work: Approximability of Packing Disjoint Cycles
cites work: Recent Results on Disjoint Cycles in Graphs
cites work: Q4198056
cites work: Packing edge-disjoint cycles in graphs and the cyclomatic number
cites work: The NP-Completeness of Some Edge-Partition Problems
cites work: Approximation algorithms and hardness results for cycle packing problems
cites work: On Edge-Disjoint Cycles in a Graph
cites work: On integrality, stability and composition of dicycle packings and covers
cites work: On packing shortest cycles in graphs
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Disjoint Cycles: Integrality Gap, Hardness, and Approximation
cites work: A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
cites work: Vertex-disjoint cycles of the same length.
cites work: A Note on Vertex-Disjoint Cycles
cites work: Large vertex-disjoint cycles in a bipartite graph
cites work: On independent cycles in a bipartite graph
cites work: Maximal total length of \(k\) disjoint cycles in bitpartite graphs
DOI: 10.1016/J.DISC.2010.03.009
description: scientific article; zbMATH DE number 5713525