Results 281 to 288 of about 33,701 (288)
Some of the next articles are maybe not open access.
On hamilton cycles and hamilton cycle decompositions of graphs based on groups
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposition of a k-regular graph is defined as the partition of the edge set into Hamilton cycles if k is even, or a partition into Hamilton cycles and a 1-factor, if k is odd.openaire +1 more source