Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters (Q2563419): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3981367 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4552174 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4876743 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3222873 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3960878 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of Complete Graphs into Isomorphic Factors with a Given Diameter / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Isomorphic factorizations of complete equipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091999 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4163259 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4129485 / rank | |||
Normal rank |
Latest revision as of 16:16, 24 May 2024
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
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
decomposition
0 references
factors
0 references
diameter
0 references