Decomposition of complete bipartite graphs into generalized prisms

DOI10.1016/J.EJC.2012.07.018zbMath1256.05184OpenAlexW2084937432MaRDI QIDQ1761503

Petr Kovář, Dalibor Fronček, Sylwia Cichacz

Publication date: 15 November 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.018

zbMATH Keywords

3-regular graphs

Mathematics Subject Classification ID

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

Related Items (3)

Decomposition of complete graphs into (0, 2)-prisms ⋮ A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes ⋮ Decomposition of certain complete bipartite graphs into prisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decompositions of complete graphs into blown-up cycles \(C_m\)[2]
• Factorization of \(K_{n,n}\) into \((0,j)\)-prisms
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Note on Decomposition of K n,n into (0,j)-prisms

This page was built for publication: Decomposition of complete bipartite graphs into generalized prisms