Results 261 to 270 of about 64,068 (309)

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.
Häggkvist, Roland, Thomason, Andrew
openaire   +1 more source

Packing Directed Hamilton Cycles Online

SIAM Journal on Discrete Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anastos, Michael, Briggs, Joseph
openaire   +2 more sources

Home - About - Disclaimer - Privacy