66 search results - page 2 / 14 » Cycles in dense digraphs |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
DM
1998
13 years 7 months ago
1998
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...
COMBINATORICS
2007
13 years 7 months ago
2007
Using a recent result of Chudnovsky, Seymour, and Sullivan, we slightly improve two bounds related to the Caccetta-Haggkvist Conjecture. Namely, we show that if α ≥ 0.35312, th...
DAM
1999
13 years 7 months ago
1999
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...
GC
2007
Springer
13 years 7 months ago
2007
Springer
Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle C of Γ is called G-consistent whenever there is an element of G whose restri...