Packing Euler graphs with traces

Peter Recht () and Eva-Maria Sprengel ()
Additional contact information
Peter Recht: Operations Research undWirtschaftsinformatik, TU Dortmund
Eva-Maria Sprengel: Operations Research undWirtschaftsinformatik, TU Dortmund

A chapter in Operations Research Proceedings 2011, 2012, pp 53-58 from Springer

Abstract: Abstract For a graph G = (V,E) and a vertex v ∈ V, let T(v) be a local trace at v, i.e. T(v) is an Eulerian subgraph of G such that every walkW(v), with start vertex v can be extended to an Eulerian tour in T(v). In general, local traces are not unique. We prove that if G is Eulerian every maximum edge-disjoint cycle packing Z* of G induces maximum local traces T(v) at v for every v ∈ V. In the opposite, if the total size $$ \sum $$V∈E|(T(v)|| is minimal then the set of related edge-disjoint cycles in G must be maximum.

Keywords: Total Size; Arbitrary Graph; Disjoint Cycle; Maximum Packing; Eulerian Tour (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-29210-1_9

Ordering information: This item can be ordered from
http://www.springer.com/9783642292101

DOI: 10.1007/978-3-642-29210-1_9

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().