2 search results - page 1 / 1 » Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6 |
ENDM
2006
13 years 4 months ago
2006
A graph is hypohamiltonian if it is not hamiltonian but every vertex-deleted subgraph is. In this paper we study hypohamiltonian snarks
SIAMDM
2000
13 years 4 months ago
2000
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...