Hamiltonskost grafov

Abstract

Keywords

Data

Language:	Slovenian
Year of publishing:	2012
Source:	Ljubljana
Typology:	2.11 - Undergraduate Thesis
Organization:	UL PEF - Faculty of Education
Publisher:	[M. Saksida]
UDC:	51(043.2)
COBISS:	9318985
Views:	1013
Downloads:	273
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Hamiltonian graphs
Secondary abstract:	The diploma work discusses about graph characteristics called hamiltonicity. Some of the important necessary and sufficient conditions are presented which tell us when a graph is or is not Hamiltonian. Among sufficient conditions we recognize Pósa's theorem and its corollaries are Ore's theorem and Dirac's theorem. We also take a look at some families of graphs that are Hamiltonian and some that are not. In the end, we briefly consider the practical aspect of searching Hamiltonian cycles in graphs.
Secondary keywords:	mathematics;matematika;
File type:	application/pdf
Type (COBISS):	Undergraduate thesis
Thesis comment:	Univ. Ljubljana, Pedagoška fak., Matematika in računalništvo
Pages:	VI, 55 str.
Type (ePrints):	thesis
Title (ePrints):	Hamiltonian graphs
Keywords (ePrints):	graf
Keywords (ePrints, secondary language):	graph
Abstract (ePrints):	Diplomsko delo obravnava lastnost grafov imenovano hamiltonskost grafov. Predstavljeni so nekateri pomembni potrebni in zadostni pogoji, ki nam povejo, kdaj graf je oziroma ni hamiltonski. Med zadostnimi pogoji spoznamo Pósev izrek in pomembni posledici tega izreka, Orejev in Diracov izrek. Ogledamo si tudi nekaj družin grafov, ki so oziroma niso hamiltonski. Na koncu na kratko obravnavamo še uporabno stran iskanja hamiltonskih ciklov v grafih.
Abstract (ePrints, secondary language):	The diploma work discusses about graph characteristics called hamiltonicity. Some of the important necessary and sufficient conditions are presented which tell us when a graph is or is not Hamiltonian. Among sufficient conditions we recognize Pósa's theorem and its corollaries are Ore's theorem and Dirac's theorem. We also take a look at some families of graphs that are Hamiltonian and some that are not. In the end, we briefly consider the practical aspect of searching Hamiltonian cycles in graphs.
Keywords (ePrints, secondary language):	graph
ID:	8310612