Decomposition of certain complete bipartite graphs into prisms

DOI10.7151/DMGT.1914zbMath1354.05112OpenAlexW2484006348MaRDI QIDQ505465

Dalibor Fronček

Publication date: 23 January 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1914

zbMATH Keywords

graph decompositionbipartite labeling

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Factorization of \(K_{n,n}\) into \((0,j)\)-prisms
• Decomposition of complete bipartite graphs into generalized prisms
• Product rosy labeling of graphs
• Note on Decomposition of K n,n into (0,j)-prisms
• Unnamed Item
• Unnamed Item
• Unnamed Item

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