- Tytuł:
- Maximum Cycle Packing in Eulerian Graphs Using Local Traces
- Autorzy:
-
Recht, Peter
Sprengel, Eva-Maria - Powiązania:
- https://bibliotekanauki.pl/articles/31339129.pdf
- Data publikacji:
- 2015-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
edge-disjoint cycle packing
local traces
extremal problems in graph theory - Opis:
- 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 walk W(v), with start vertex v can be extended to an Eulerian tour in T(v). We prove that every maximum edge-disjoint cycle packing Z* of G induces a maximum trace T(v) at v for every v ∈ V. Moreover, if G is Eulerian then sufficient conditions are given that guarantee that the sets of cycles inducing maximum local traces of G also induce a maximum cycle packing of G.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2015, 35, 1; 121-132
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł