Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Split Euler Tours In 4-Regular Planar Graphs

PJ CouchB.D. DanielR. GuidryW. Paul Wright — 2016

Discussiones Mathematicae Graph Theory

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...

Page 1

Download Results (CSV)