<div class="csl-bib-body">
<div class="csl-entry">Leder, F. R. (2012). <i>Uniquely hamiltonian graphs</i> [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160080</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/160080
-
dc.description.abstract
In 1998, J.A. Bondy and B. Jackson conjectured that every simple uniquely hamiltonian planar graph has at least two vertices of degree two. We shall start by providing an overview on many popular results on the number of hamiltonian cycles in a graph. Furthermore we will review the construcion of a uniquely hamiltonian graph of minimum degree four, made by Fleischner. Finally we try to apply similar techniques to obtain a counterexample to the conjecture made by Bondy and Jackson.
en
dc.language
English
-
dc.language.iso
en
-
dc.subject
hamilton
de
dc.subject
graph
de
dc.subject
hamilton-Kreis
de
dc.subject
hamiltonian
en
dc.subject
uniquely hamiltonian
en
dc.subject
graph
en
dc.title
Uniquely hamiltonian graphs
en
dc.type
Thesis
en
dc.type
Hochschulschrift
de
dc.contributor.affiliation
TU Wien, Österreich
-
tuw.thesisinformation
Technische Universität Wien
-
dc.contributor.assistant
Fleischner, Herbert
-
tuw.publication.orgunit
E186 - Institut für Computergraphik und Algorithmen
-
dc.type.qualificationlevel
Diploma
-
dc.identifier.libraryid
AC07814875
-
dc.description.numberOfPages
61
-
dc.thesistype
Diplomarbeit
de
dc.thesistype
Diploma Thesis
en
tuw.advisor.staffStatus
exstaff
-
tuw.assistant.staffStatus
staff
-
item.openairetype
Thesis
-
item.openairetype
Hochschulschrift
-
item.grantfulltext
none
-
item.cerifentitytype
Publications
-
item.cerifentitytype
Publications
-
item.languageiso639-1
en
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
item.fulltext
no Fulltext
-
crisitem.author.dept
E104 - Institut für Diskrete Mathematik und Geometrie