Packing edge-disjoint cycles in graphs and the cyclomatic number
From MaRDI portal
Publication:968414
DOI10.1016/J.DISC.2009.07.017zbMATH Open1218.05076OpenAlexW2072741658MaRDI QIDQ968414FDOQ968414
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Approximation algorithms and hardness results for cycle packing problems
- Packing cycles in undirected graphs
- Packing triangles in bounded degree graphs.
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
- On packing shortest cycles in graphs
- On Edge-Disjoint Cycles in a Graph
Cited In (8)
- Approximability of Packing Disjoint Cycles
- Packing disjoint cycles over vertex cuts
- Packing cycles in graphs. II
- Maximum cycle packing using SPR-trees
- Maximum cycle packing in Eulerian graphs using local traces
- Title not available (Why is that?)
- Cyclomatic numbers of connected induced subgraphs
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs
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)
