An algorithm for finding factorizations of complete graphs (Q4406068)

From MaRDI portal
Revision as of 19:54, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    25 June 2003
    0 references
    factorization
    0 references
    complete graph
    0 references
    algorithm
    0 references
    regular factor
    0 references

    Identifiers