Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters (Q2563419)

From MaRDI portal
Revision as of 16:16, 24 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters
scientific article

    Statements

    Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters (English)
    0 references
    0 references
    11 February 1997
    0 references
    The author completely determines the pairs \((m,n)\) (the triples \((k,m,n)\)) for which there exists a decomposition of \(K_{m,n}\) \((K_{k,m,n}\), respectively) into two isomorphic factors with a finite diameter.
    0 references
    0 references
    decomposition
    0 references
    factors
    0 references
    diameter
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references