Decompositions of some classes of dense graphs into cycles of lengths 4 and 8

DOI10.1007/s00373-021-02317-6zbMath1469.05141OpenAlexW3154369394MaRDI QIDQ2042208

S. Ganesamurthy, P. Paulraja

Publication date: 28 July 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02317-6

zbMATH Keywords

tensor productcomplete multipartite graphcycle decomposition

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \((4, 5)\)-cycle systems of complete multipartite graphs
• Decompositions of complete multigraphs into cycles of varying lengths
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
• Path and cycle decompositions of complete equipartite graphs: Four parts
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Balanced incomplete block designs and related designs
• Decomposing complete tripartite graphs into cycles of lengths 3 and 4
• Decomposition of \(K_{m,n}\) into short cycles
• On Hamilton cycle decompositions of the tensor product of complete graphs
• \(2p\)-cycle decompositions of some regular graphs and digraphs
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Decompositions of complete multipartite graphs into cycles of even length
• Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6
• \(C_7\)-decompositions of the tensor product of complete graphs
• \(C_{p}\)-decompositions of some regular graphs
• Decomposition of a complete bipartite multigraph into arbitrary cycle sizes
• Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
• Decomposition of complete bipartite graphs into cycles of distinct even lengths
• Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach
• Cycle Frames of Complete Multipartite Multigraphs - III
• Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd
• Decomposing complete equipartite graphs into cycles of length2p
• Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
• A textbook of graph theory

This page was built for publication: Decompositions of some classes of dense graphs into cycles of lengths 4 and 8