Decomposition of the complete directed graph into k-circuits (Q1232420): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences in groups with distinct partial products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5345646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5539657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cyclic decompositions of the complete graph into polygons with odd number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures / rank
 
Normal rank

Latest revision as of 19:15, 12 June 2024

scientific article
Language Label Description Also known as
English
Decomposition of the complete directed graph into k-circuits
scientific article

    Statements

    Identifiers