147 search results - page 5 / 30 » Cycle decompositions of the complete graph |
DM
2008
13 years 8 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
IPL
2007
13 years 7 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 ...
SIAMDM
2010
13 years 2 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
SIAMDM
2008
13 years 7 months ago
2008
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
ISTCS
1997
Springer
13 years 11 months ago
1997
Springer
