Edge partitions of the complete symmetric directed graph and related designs (Q1158162): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of the complete directed graph into k-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4769064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $F$-Square and Orthogonal $F$-Squares Design: A Generalization of Latin Square and Orthogonal Latin Squares Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decompositions, handcuffed prisoners and balanced p-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of Complete Graphs Defined by Quasigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials that represent quadratic residues at primitive roots / rank
 
Normal rank

Latest revision as of 14:07, 13 June 2024

scientific article
Language Label Description Also known as
English
Edge partitions of the complete symmetric directed graph and related designs
scientific article

    Statements

    Edge partitions of the complete symmetric directed graph and related designs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    complete symmetric directed graph
    0 references
    directed cycles
    0 references