Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs II: paws
Combinatorics
2020-06-17 v1
Abstract
In this paper we extend a result about a sufficient condition for Hamiltonicity for finite graphs by Broersma and Veldmann to locally finite graphs. In order to do this we use topological circles within the Freudenthal compactification of a locally finite graph as infinite cycles. The condition we focus on in this paper is in terms of forbidden induced subgraphs, namely being claw-free and a relaxation of being paw-free.
Keywords
Cite
@article{arxiv.2006.09166,
title = {Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs II: paws},
author = {Karl Heuer and Deniz Sarikaya},
journal= {arXiv preprint arXiv:2006.09166},
year = {2020}
}
Comments
20 pages, 5 figures