147 search results - page 7 / 30 » Cycle decompositions of the complete graph |
COMBINATORICS
2006
13 years 8 months ago
2006
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
DM
2008
13 years 8 months ago
2008
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices. If F consists of Hamiltonian cycles, then F is the...
GC
2010
Springer
13 years 5 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
ENDM
2002
13 years 7 months ago
2002
Two types of robust cycle bases are defined via recursively nice arrangements; complete and bipartite complete graphs are shown to have such bases. It is shown that a diagram in a...
DM
2007
13 years 8 months ago
2007
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...