h1

% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@PHDTHESIS{Helden:62349,
      author       = {Helden, Guido},
      othercontributors = {Guo, Yubao},
      title        = {{H}amiltonicity of maximal planar graphs and planar
                      triangulations},
      address      = {Aachen},
      publisher    = {Publikationsserver der RWTH Aachen University},
      reportid     = {RWTH-CONV-123920},
      pages        = {V, 102 S. : graph. Darst.},
      year         = {2007},
      note         = {Errata vom 21.05.2013; Aachen, Techn. Hochsch., Diss.,
                      2007},
      abstract     = {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.},
      keywords     = {Hamilton-Kreis (SWD) / Graphentheorie (SWD)},
      cin          = {114510 / 110000},
      ddc          = {510},
      cid          = {$I:(DE-82)114510_20140620$ / $I:(DE-82)110000_20140620$},
      shelfmark    = {05C10 * 05C45},
      typ          = {PUB:(DE-HGF)11},
      urn          = {urn:nbn:de:hbz:82-opus-19494},
      url          = {https://publications.rwth-aachen.de/record/62349},
}