Decomposition of complete graphs into (0, 2)-prisms

DOI10.1007/S10587-014-0080-2zbMath1340.05185OpenAlexW2074044667MaRDI QIDQ2940621

Dalibor Fronček, Sylwia Cichacz, Soleh Dib

Publication date: 27 January 2015

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/143946

zbMATH Keywords

prismdecompositions\(\varrho^+\)-labeling

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Factorization of \(K_{n,n}\) into \((0,j)\)-prisms
• Decomposition of complete bipartite graphs into generalized prisms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of complete graphs into (0, 2)-prisms