Factorization of \(K_{n,n}\) into \((0,j)\)-prisms

DOI10.1016/j.ipl.2009.04.024zbMath1197.05116OpenAlexW1544350155MaRDI QIDQ989530

Sylwia Cichacz, Dalibor Fronček

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.04.024

zbMATH Keywords

prismfactorizationgraph algorithms

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 ⋮ Decomposition of certain complete bipartite graphs into prisms ⋮ Decomposition of complete bipartite graphs into generalized prisms

Cites Work

• The solution of the bipartite analogue of the Oberwolfach problem
• Cube factorizations of complete graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Factorization of \(K_{n,n}\) into \((0,j)\)-prisms