Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
From MaRDI portal
Publication:891319
DOI10.7151/DMGT.1830zbMath1327.05174OpenAlexW2518069832MaRDI QIDQ891319
Appu Muthusamy, Shanmugasundaram Jeevadoss
Publication date: 17 November 2015
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1830
Related Items (4)
Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars ⋮ Decomposition of hypercube graphs into paths and cycles of length four ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ Decomposition of product graphs into paths and stars on five vertices
Cites Work
- Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars
- Decomposition of complete bipartite graphs into paths and cycles
- Decomposition of complete graphs into paths and stars
- Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decomposition of \(K_{m,n}\) into short cycles
- Multidesigns for graph-pairs of order 4 and 5
- Decomposition of complete bipartite graphs into paths and stars with same number of edges
- Decomposition of complete graphs into cycles and stars
- Multidecompositions of the balanced complete bipartite graph into paths and stars
- Multidecompositions of several graph products
- Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
- Sufficient Condition for {C 4, C 2t } - Decomposition of K 2m,2n – An Improved Bound
- On the decompositions of complete graphs into cycles and stars on the same number of edges
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
