Maximum cycle packing using SPR-trees

DOI10.5614/EJGTA.2019.7.1.11MaRDI QIDQ5009941zbMATH OpenOpenAlexWikidataFDO

Authors Christin Otto, Peter Recht

Publication date 23 August 2021

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2019.7.1.11

zbMATH Keywords

decompositionedge-disjoint cyclemaximum cycle packingSPR-trees

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Approximation algorithms for cycle packing problems
• Packing cycles in undirected graphs
• Approximation algorithms and hardness results for cycle packing problems
• Approximability of Packing Disjoint Cycles
• Approximability of packing disjoint cycles

Cites work

• Approximability of packing disjoint cycles
• Approximation algorithms and hardness results for cycle packing problems
• Combinatorial algorithms on a class of graphs
• Edge disjoint cycles in graphs
• scientific article; zbMATH DE number 2038697 (Why is no real title available?)
• scientific article; zbMATH DE number 2080088 (Why is no real title available?)
• scientific article; zbMATH DE number 908792 (Why is no real title available?)
• scientific article; zbMATH DE number 3215864 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• Obstructions for the Disk and the Cylinder Embedding Extension Problems
• On maximum cycle packings in polyhedral graphs
• On packing shortest cycles in graphs
• On the maximal number of independent circuits in a graph
• On-line maintenance of triconnected components with SPQR-trees
• Packing cycles in undirected graphs
• Packing disjoint cycles over vertex cuts
• Packing edge-disjoint cycles in graphs and the cyclomatic number
• Packing Euler graphs with traces

Cited in

(1)

• Cycle decompositions and constructive characterizations

This page was built for publication: Maximum cycle packing using SPR-trees

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