Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)
From MaRDI portal
Publication:2092386
DOI10.1016/j.disc.2022.113160zbMath1502.05201OpenAlexW4296693697MaRDI QIDQ2092386
A. Pauline Ezhilarasi, Appu Muthusamy
Publication date: 2 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113160
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Decomposition of complete bipartite graphs into paths and cycles
- Decomposition of complete graphs into triangles and claws
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
- Path and cycle decompositions of complete equipartite graphs: Four parts
- 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\)
- Decomposing various graphs into short even-length cycles
- Cycle decompositions III: Complete graphs and fixed length cycles
- Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd
- Decomposing complete equipartite graphs into cycles of length2p
- Decomposition of product graphs into paths and cycles of length four
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)