Sciweavers

ENDM
2006
73views more  ENDM 2006»
13 years 4 months ago
Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6
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