1485 search results - page 8 / 297 » connection 2010 |
40
Voted
CORR
2010
Springer
15 years 17 days ago
2010
Springer
TIT
2010
14 years 10 months ago
2010
TWC
2010
14 years 9 months ago
2010
ENDM
2006
15 years 3 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
123
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2