8 search results - page 1 / 2 » Linkedness and Ordered Cycles in Digraphs |
CPC
2008
13 years 5 months ago
2008
CORR
2008
Springer
13 years 5 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
2002
13 years 5 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
WG
2009
Springer
14 years 1 days 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 ...
JCT
2008
13 years 5 months ago
2008
