| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653131 | Electronic Notes in Discrete Mathematics | 2006 | 8 Pages |
Abstract
A non-hamiltonian graph is called hypohamiltonian if it becomes hamiltonian by deleting an arbitrary vertex. In this paper we describe a construction which produces cyclically 5-connected and cyclically 6-connected hypohamiltonian snarks (cubic graphs with chromatic index 4) of all but finitely many orders. Our construction considerably extends the collection of known hypohamilonian cubic graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
