686 search results - page 26 / 138 » Packing Cycles in Graphs |
123
click to vote
WG
2009
Springer
15 years 8 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...
110
click to vote
WG
2010
Springer
15 years 8 days ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
DM
2008
15 years 2 months ago
2008
In this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a 1-factor, Kn - I, exist if and only if n 2, 4( mod 8) and n = 2p with p
115
click to vote
IPL
2007
15 years 1 months ago
2007
This paper presents a construction of a minimum cycle basis for the direct product of two complete graphs on three or more vertices. With the exception of two special cases, such ...