- Tytuł:
- Split Euler Tours In 4-Regular Planar Graphs
- Autorzy:
-
Couch, PJ
Daniel, B.D.
Guidry, R.
Paul Wright, W. - Powiązania:
- https://bibliotekanauki.pl/articles/31341188.pdf
- Data publikacji:
- 2016-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
4-regular
3-connected
planar
split Euler tour
NP-complete - Opis:
- The construction of a homing tour is known to be NP-complete. On the other hand, the Euler formula puts su cient restrictions on plane graphs that one should be able to assert the existence of such tours in some cases; in particular we focus on split Euler tours (SETs) in 3-connected, 4-regular, planar graphs (tfps). An Euler tour S in a graph G is a SET if there is a vertex v (called a half vertex of S) such that the longest portion of the tour between successive visits to v is exactly half the number of edges of G. Among other results, we establish that every tfp G having a SET S in which every vertex of G is a half vertex of S can be transformed to another tfp G′ having a SET S′ in which every vertex of G′ is a half vertex of S′ and G′ has at most one point having a face configuration of a particular class. The various results rely heavily on the structure of such graphs as determined by the Euler formula and on the construction of tfps from the octahedron. We also construct a 2-connected 4-regular planar graph that does not have a SET.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2016, 36, 1; 23-30
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł