h1

TY  - THES
AU  - Helden, Guido
TI  - Hamiltonicity of maximal planar graphs and planar triangulations
CY  - Aachen
PB  - Publikationsserver der RWTH Aachen University
M1  - RWTH-CONV-123920
SP  - V, 102 S. : graph. Darst.
PY  - 2007
N1  - Errata vom 21.05.2013
N1  - Aachen, Techn. Hochsch., Diss., 2007
AB  - This thesis mainly deals with the existence of hamiltonian cycles and hamiltonian paths in maximal planar graphs and planar triangulations. The first part of this dissertation focus on the question, what is the maximal number k, so that every maximal planar graph with at most k separating triangles is hamiltonian? An analysis of the structure shows a special structure of the position of the separating triangles to each other, which will also generate hamiltonicity. Moreover, this part deals with the question how many vertices of a hamiltonian maximal planar graph can be deleted, so that the remaining graph is still hamiltonian. The second part examines the existence of hamiltonian cycles in planar triangulations. This dissertation closes with some applications of hamiltonian maximal planar graphs and planar triangulations in computer graphics and chemistry.
KW  - Hamilton-Kreis (SWD)
KW  - Graphentheorie (SWD)
LB  - PUB:(DE-HGF)11
UR  - https://publications.rwth-aachen.de/record/62349
ER  -