Packing Euler graphs with traces

DOI10.1007/978-3-642-29210-1_9MaRDI QIDQ5176280zbMATH OpenOpenAlexFDO

Authors Eva-Maria Sprengel, Peter Recht

Publication date 3 March 2015

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29210-1_9

Mathematics Subject Classification ID

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

Recommendations

• Maximum cycle packing in Eulerian graphs using local traces
• Infinite Euler Graphs
• scientific article; zbMATH DE number 11984
• scientific article; zbMATH DE number 4081604
• Packing circuits in eulerian digraphs

Cites work

• A problem regarding the tracing of graphs
• Approximation algorithms and hardness results for cycle packing problems
• Combinatorics of genome rearrangements.
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Genome Rearrangements and Sorting by Reversals
• Packing cycles in undirected graphs
• Packing disjoint cycles over vertex cuts
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Über eine spezielle Klasse Eulerscher Graphen

Cited in

(3)

• Maximum cycle packing in Eulerian graphs using local traces
• Packing Digraphs with Directed Closed Trails
• Maximum cycle packing using SPR-trees

This page was built for publication: Packing Euler graphs with traces

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