Packing edge-disjoint cycles in graphs and the cyclomatic number
type: Item
instance of: scholarly article
title: Packing edge-disjoint cycles in graphs and the cyclomatic number
zbMATH Open document ID: 1218.05076
author: Jochen Harant
author: Peter Recht
author: Friedrich Regen
author: Dieter Rautenbach
published in: Discrete Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5703944
zbMATH Keywords: graph
zbMATH Keywords: cycle
zbMATH Keywords: packing
zbMATH Keywords: cyclomatic number
MaRDI profile type: Publication
full work available at URL: j.disc.2009.07.017
OpenAlex ID: W2072741658
cites work: Q3852212
cites work: Sorting Permutations by Reversals and Eulerian Cycle Decompositions
cites work: Packing cycles in undirected graphs
cites work: Packing triangles in bounded degree graphs.
cites work: Q5342984
cites work: Approximation algorithms and hardness results for cycle packing problems
cites work: On Edge-Disjoint Cycles in a Graph
cites work: On packing shortest cycles in graphs
cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
cites work: A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
cites work: Q4775880
DOI: 10.1016/J.DISC.2009.07.017
description: scientific article; zbMATH DE number 5703944