Results 281 to 284 of about 60,523 (284)
Some of the next articles are maybe not open access.

Oriented hamilton cycles in digraphs

Journal of Graph Theory, 1995
AbstractWe show that a directed graph of order n will contain n‐cycles of every orientation, provided each vertex has indegree and outdegree at least (1/2 + n‐1/6)n and n is sufficiently large. © 1995 John Wiley & Sons, Inc.
Roland Häggkvist, Andrew Thomason
openaire   +2 more sources

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

Home - About - Disclaimer - Privacy