Split Euler Tours In 4-Regular Planar Graphs
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, pla...
Main Authors: | Couch PJ, Daniel B.D., Guidry R., Paul Wright W. |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2016-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1836 |
Similar Items
-
Regularity and Planarity of Token Graphs
by: Carballosa Walter, et al.
Published: (2017-08-01) -
Complexity of domination in triangulated plane graphs
by: Pálvölgyi Dömötör
Published: (2019-12-01) -
Existence of Regular Nut Graphs for Degree at Most 11
by: Fowler Patrick W., et al.
Published: (2020-05-01) -
Gromov hyperbolicity of planar graphs
by: Cantón Alicia, et al.
Published: (2013-10-01) -
Spectra of Orders for k-Regular Graphs of Girth g
by: Jajcay Robert, et al.
Published: (2021-11-01)