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

DOI10.1007/978-3-642-35926-2_17zbMath1293.05216OpenAlexW2292226098MaRDI QIDQ2876569

Appu Muthusamy, Shanmugasundaram Jeevadoss

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)

Related Items (3)

Decomposition of complete bipartite graphs into paths and cycles ⋮ Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges ⋮ Decomposition of product graphs into paths and cycles of length four

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