Search Sciweavers | Sciweavers

8 search results - page 1 / 2

» Oriented Hamiltonian Cycles in Tournaments

click to vote

JCT
2000

51views more JCT 2000»

Oriented Hamiltonian Cycles in Tournaments

13 years 5 months ago

Download www-sop.inria.fr

Frédéric Havet

claim paper

Read More »

click to vote

DAM
1999

81views more DAM 1999»

On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs

13 years 5 months ago

Download www.cs.rhul.ac.uk

We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed in...

Jørgen Bang-Jensen, Gregory Gutin

claim paper

Read More »

click to vote

GC
2006
Springer

72views Applied Computing» more GC 2006»

On n-partite Tournaments with Unique n-cycle

13 years 5 months ago

Download www.cs.sfu.ca

An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...

Gregory Gutin, Arash Rafiey, Anders Yeo

claim paper

Read More »

click to vote

COMBINATORICS
2006

107views more COMBINATORICS 2006»

A Note on the Number of Hamiltonian Paths in Strong Tournaments

13 years 5 months ago

Download www.univie.ac.at

We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...

Arthur H. Busch

claim paper

Read More »

click to vote

DAM
2000

83views more DAM 2000»

Pancyclic out-arcs of a Vertex in Tournaments

13 years 5 months ago