K₁,k-factorization of bipartite graphs
Let \(\lambda K_{m,n}\) denote the bipartite graph which is the disjoint union of \(\lambda\) graphs, each of which is isomorphic to \(K_{m,n}\). A \(K_{1,k}\)-factor of a graph \(G\) is a spanning subgraph of \(G\) composed of vertex disjoint copies of \(K_{1,k}\). A \(K_{1,k}\)-factorization of a graph \(G\) is a decomposition of the edges of \(G\) into \(K_{1,k}\)-factors. The author gives a necessary condition for \(\lambda K_{m,n}\) to admit a \(K_{1,k}\)-factorization. Furthermore, the author gives a sufficient condition for \(k K_{m,n}\) to have a \(K_{1,k}\)-factorization whenever \(k\) is a prime number.
- \(K_{1,k}\)-factorization of complete bipartite graphs
- On \(K_{1,k}\)-factorization of bipartite multigraphs
- \(K_{1,p^k}\)-factorization of complete bipartite graphs
- \(K_{1,p^2}\)-factorization of complete bipartite graphs
- On \(K_{1,k}\)-factorizations of a complete bipartite graph
- scientific article; zbMATH DE number 1833078
- On 1-factorizations of bipartite Kneser graphs
- On 1-factorizations of bipartite Kneser graphs
- \(K_{p,q}\)-factorization of complete bipartite graphs
- \(C_ k\)-factorization of complete bipartite graphs
- On \(K_{1,k}\)-factorization of bipartite multigraphs
- \(C_ k\)-factorization of complete bipartite graphs
- k-regular factors and semi-k-regular factors in bipartite graphs
- On \(K_{1,k}\)-factorizations of a complete bipartite graph
- An explicit 1-factorization in the middle of the Boolean lattice
- \(K_{1,k}\)-factorization of complete bipartite graphs
- scientific article; zbMATH DE number 1833078 (Why is no real title available?)
- On 1-factorizations of bipartite Kneser graphs
- On 1-factorizations of bipartite Kneser graphs
- Star-factorization of the complete bipartite multigraphs
- Bipartite variation of the cheesecake factory problem: \(mH(k,2l+1)\)-factorization of \(K_{n,n}\)
This page was built for publication: \(K_{1,k}\)-factorization of bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377191)