Some cyclic properties of graphs with local Ore-type conditions
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. In this thesis we investigate two classes of graphs, defined by local criteria. Graphs in these classes, with a simple set of exceptions K, were proven to...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Linköpings universitet, Matematik och tillämpad matematik
2016
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-129213 |