62 search results - page 1 / 13 » Consistent Cycles in Graphs and Digraphs |
GC
2007
Springer
13 years 8 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...
SIAMDM
2008
13 years 8 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
CORR
2008
Springer
13 years 8 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 8 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...
WG
2009
Springer
14 years 3 months ago
2009
Springer
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...