Sciweavers

1485 search results - page 8 / 297
» connection 2010
Sort
View
ENDM
2006
73views more  ENDM 2006»
15 years 3 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
CORR
2010
Springer
126views Education» more  CORR 2010»
14 years 11 months ago
From Pathwidth to Connected Pathwidth
It is proven that the connected pathwidth of any graph G is at most 2
Dariusz Dereniowski