Packing edge-disjoint cycles in graphs and the cyclomatic number

DOI10.1016/j.disc.2009.07.017zbMath1218.05076OpenAlexW2072741658MaRDI QIDQ968414

Friedrich Regen, Jochen Harant, Peter Recht, Dieter Rautenbach

Publication date: 5 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.07.017

zbMATH Keywords

graphcyclepackingcyclomatic number

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

Maximum cycle packing in Eulerian graphs using local traces ⋮ Packing disjoint cycles over vertex cuts ⋮ Maximum cycle packing using SPR-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On packing shortest cycles in graphs
• Packing triangles in bounded degree graphs.
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Packing cycles in undirected graphs
• Approximation algorithms and hardness results for cycle packing problems
• 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

This page was built for publication: Packing edge-disjoint cycles in graphs and the cyclomatic number