Factorization of K_n,n into (0,j)-prisms

DOI10.1016/J.IPL.2009.04.024zbMATH Open1197.05116OpenAlexW1544350155MaRDI QIDQ989530FDOQ989530

Authors: 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

Recommendations

• Note on decomposition of \(K _{n,n }\) into \((0,j)\)-prisms
• Note on factorization of complete bipartite multigraph into {\((0,j)\)}-prisms
• scientific article; zbMATH DE number 1031243
• Factorization in \(K[S]\)
• scientific article; zbMATH DE number 3847463
• Complete bipartite factorisations of \(K _{n,n}\)
• Factorization into \(k\)-dimensional linear bijections
• On tree factorizations of K_n
• Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences
• Factorization in K[Xⁿ, Xⁿ⁺¹,…,X²ⁿ⁻¹]

zbMATH Keywords

prismfactorizationgraph algorithms

Mathematics Subject Classification ID

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

Cites Work

• The solution of the bipartite analogue of the Oberwolfach problem
• Title not available (Why is that?)
• Cube factorizations of complete graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Decomposition of complete bipartite graphs into generalized prisms
• Decomposition of complete graphs into \((0,2)\)-prisms.
• Decomposition of certain complete bipartite graphs into prisms

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

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