Decomposition of complete bipartite graphs into paths and cycles

DOI10.1016/j.disc.2014.05.009zbMath1297.05190OpenAlexW2004155392MaRDI QIDQ397156

Appu Muthusamy, Shanmugasundaram Jeevadoss

Publication date: 8 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.05.009

zbMATH Keywords

cyclecomplete bipartite graphpathgraph decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars ⋮ Decomposition of hypercube graphs into paths and cycles of length four ⋮ Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decomposition of product graphs into paths and cycles of length four ⋮ Decomposition of complete tripartite graphs into cycles and paths of length three ⋮ Decomposition of complete equipartite graphs into paths and cycles of length \(2p\) ⋮ Decompositions of line graphs of complete graphs into paths and cycles ⋮ Decomposition of complete bipartite graphs into cycles and stars with four edges ⋮ Decomposition of product graphs into paths and stars on five vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 a complete multigraph into simple paths: nonbalanced handcuffed designs
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• 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
• Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
• Cycle decompositions III: Complete graphs and fixed length cycles
• Sufficient Condition for {C 4, C 2t } - Decomposition of K 2m,2n – An Improved Bound