An algorithm for finding factorizations of complete graphs (Q4406068)

From MaRDI portal
Revision as of 02:32, 3 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q114236193, #quickstatements; #temporary_batch_1712101902020)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1934639
Language Label Description Also known as
English
An algorithm for finding factorizations of complete graphs
scientific article; zbMATH DE number 1934639

    Statements

    An algorithm for finding factorizations of complete graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2003
    0 references
    0 references
    factorization
    0 references
    complete graph
    0 references
    algorithm
    0 references
    regular factor
    0 references
    0 references
    0 references