Packing edge-disjoint cycles in graphs and the cyclomatic number

DOI10.1016/J.DISC.2009.07.017MaRDI QIDQ968414zbMATH OpenOpenAlexFDO

Authors Jochen Harant, Peter Recht, Friedrich Regen, 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)

Recommendations

• Graphs with many vertex-disjoint cycles
• scientific article; zbMATH DE number 147631
• Edge-disjoint odd cycles in planar graphs.
• Packing disjoint cycles over vertex cuts
• On independent cycles and edges in graphs

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3451870 (Why is no real title available?)
• scientific article; zbMATH DE number 3215864 (Why is no real title available?)
• A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
• Approximation algorithms and hardness results for cycle packing problems
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• On Edge-Disjoint Cycles in a Graph
• On packing shortest cycles in graphs
• Packing cycles in undirected graphs
• Packing triangles in bounded degree graphs.
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions

Cited in

(10)

• Maximum cycle packing using SPR-trees
• Maximum cycle packing in Eulerian graphs using local traces
• Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs
• Cyclomatic numbers of connected induced subgraphs
• Packing cycles in graphs. II
• Packing disjoint cycles over vertex cuts
• \(D\)-graphs for graphs with cyclomatic number 1.
• Graphs with many vertex-disjoint cycles
• Approximability of Packing Disjoint Cycles
• scientific article; zbMATH DE number 147631 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968414)