Sufficient Condition for {C 4, C 2t } - Decomposition of K 2m,2n – An Improved Bound

DOI10.1007/978-3-642-35926-2_17MaRDI QIDQ2876569zbMATH OpenOpenAlexFDO

Authors S. Jeevadoss, A. Muthusamy

Publication date 19 August 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35926-2_17

zbMATH Keywords

complete bipartite graphcycle decomposition

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51)

Recommendations

• Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
• scientific article; zbMATH DE number 26326
• Primitive C4 ${C}_{4}$‐decompositions of Kn−I ${K}_{n}-I$
• \(K_n(\lambda)\) is fully \(\{P_4,C_4\}\)-decomposable
• On the discretely decomposable restrictions of (𝔤,K)-modules for Klein four symmetric pairs
• An improvement on the bound for C₂ (n)
• On the 2-decomposition numbers of 𝑆𝑝(4,𝑞)
• 4t-cycle decomposition of the 2-fold tensor product (K_m K_n)(2)
• A new labeling of \(C_{2n}\) proves that \(K_4+M_{6n}\) decomposes \(K_{6n+4}\).
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)

Cited in

(4)

• Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
• Decomposition of complete bipartite graphs into paths and cycles
• Decomposition of product graphs into paths and cycles of length four
• Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges

This page was built for publication: Sufficient Condition for {C 4, C 2t } - Decomposition of K 2m,2n – An Improved Bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876569)