Almost self-complementary factors of complete bipartite graphs (Q1356470)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Almost self-complementary factors of complete bipartite graphs |
scientific article; zbMATH DE number 1018523
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost self-complementary factors of complete bipartite graphs |
scientific article; zbMATH DE number 1018523 |
Statements
Almost self-complementary factors of complete bipartite graphs (English)
0 references
8 October 1997
0 references
It is proved that the graph \(K_{2n+1,2m+1}\) minus one edge can be decomposed into two isomorphic factors with a given diameter \(d\) only if \(3\leq d\leq 6\) or if \(d=\infty\); in each case the decomposable graphs are completely characterized. Moreover, for \(d=\infty\) all classes of possible disconnected factors are determined.
0 references
almost complete bipartite graph
0 references
factorization
0 references
