Factorization of de Bruijn digraphs by cycle-rooted trees (Q1603418): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Group Action Graphs and Parallel Architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting and Gossiping in de Bruijn Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4313087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cayley Digraphs Based on the de Bruijn Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Regular Directed Graphs with Small Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332941 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(00)00157-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064769957 / rank
 
Normal rank

Latest revision as of 11:34, 30 July 2024

scientific article
Language Label Description Also known as
English
Factorization of de Bruijn digraphs by cycle-rooted trees
scientific article

    Statements

    Factorization of de Bruijn digraphs by cycle-rooted trees (English)
    0 references
    0 references
    0 references
    0 references
    14 July 2002
    0 references
    0 references
    interconnection networks
    0 references
    arc-coloring
    0 references
    1-factorization
    0 references
    line digraph
    0 references
    de Bruijn digraph
    0 references
    0 references