Results 311 to 319 of about 3,218,251 (319)
Some of the next articles are maybe not open access.

A note on the 2-power of Hamilton cycles

Discrete Mathematics, 2022
Z. U. Khan, Long-Tu Yuan
semanticscholar   +1 more source

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

Hamilton cycles in regular graphs

Journal of Graph Theory, 1978
openaire   +1 more source

Home - About - Disclaimer - Privacy