Almost self-complementary factors of complete bipartite graphs
From MaRDI portal
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.
Recommendations
Cites work
- Decomposition of Complete Graphs into Isomorphic Factors with a Given Diameter
- scientific article; zbMATH DE number 3889563 (Why is no real title available?)
- scientific article; zbMATH DE number 4105006 (Why is no real title available?)
- scientific article; zbMATH DE number 21751 (Why is no real title available?)
- scientific article; zbMATH DE number 3556148 (Why is no real title available?)
- scientific article; zbMATH DE number 3596892 (Why is no real title available?)
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 1792591 (Why is no real title available?)
- scientific article; zbMATH DE number 874209 (Why is no real title available?)
Cited in
(5)- Rao's conjecture on self-complementary graphs withK-factors
- scientific article; zbMATH DE number 1186104 (Why is no real title available?)
- scientific article; zbMATH DE number 1501971 (Why is no real title available?)
- scientific article; zbMATH DE number 1404128 (Why is no real title available?)
- Corrigendum to ``Almost self-complementary factors of complete bipartite graphs. [Discrete Math. 167/168 (1997), 317-327]
This page was built for publication: Almost self-complementary factors of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356470)