618 search results - page 9 / 124 » Short cycle connectivity |
105
click to vote
JACM
2007
15 years 18 days ago
2007
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
101
Voted
DM
1998
15 years 11 days ago
1998
It has been shown that there is a Hamilton cycle in every connected Cayley graph on any group G whose commutator subgroup is cyclic of prime-power order. This note considers conne...
99
Voted
SIAMDM
2008
15 years 5 days ago
2008
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...
80
Voted
DM
2002
15 years 15 days ago
2002
It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the or...
MP
2006
15 years 19 days ago
2006
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...