Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6

13 years 4 months ago

A graph is hypohamiltonian if it is not hamiltonian but every vertex-deleted subgraph is. In this paper we study hypohamiltonian snarks

Edita Mácajová, Martin Skoviera

Cubic Hypohamiltonian Graphs | Cyclic Connectivity | ENDM 2006 | Hypohamiltonian Snarks |

claim paper

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	ENDM
Authors	Edita Mácajová, Martin Skoviera

Comments (0)