Approximate cycle double cover

DOI10.1007/978-3-031-63021-7_32MaRDI QIDQ7021076zbMATH OpenFDO

Authors Babak Ghanbari, Robert Šámal

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_32

zbMATH Keywords

approximationcycle double coverembedding

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• Circuit double cover of graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Cycle double covers of graphs with Hamilton paths
• Double covers of cubic graphs with oddness 4
• Edge-Disjoint Spanning Trees of Finite Graphs
• Graphs on surfaces
• scientific article; zbMATH DE number 5130820 (Why is no real title available?)
• scientific article; zbMATH DE number 3728302 (Why is no real title available?)
• Maximum matching and a polyhedron with 0,1-vertices
• On the Problem of Decomposing a Graph into n Connected Factors
• Perfect matching for biconnected cubic graphs in \(O(n \log ^{2} n)\) time
• Polyhedral decompositions of cubic graphs
• Semi-duality and the cycle double cover conjecture

Cited in

(1)

• On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs

This page was built for publication: Approximate cycle double cover

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