325 search results - page 3 / 65 » Hamilton cycles in random graphs and directed graphs |
DM
1998
14 years 11 months 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...
100
click to vote
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
RSA
2002
14 years 11 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
87
Voted
SIAMDM
2008
14 years 11 months 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...
93
Voted
WG
2009
Springer
15 years 6 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...