Decomposition of certain complete bipartite graphs into prisms
From MaRDI portal
Publication:505465
DOI10.7151/DMGT.1914zbMATH Open1354.05112OpenAlexW2484006348MaRDI QIDQ505465FDOQ505465
Authors: 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
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- Decomposition of complete bipartite graphs into generalized prisms
- Title not available (Why is that?)
- Product rosy labeling of graphs
- Note on decomposition of \(K _{n,n }\) into \((0,j)\)-prisms
- Title not available (Why is that?)
- Factorization of \(K_{n,n}\) into \((0,j)\)-prisms
Cited In (6)
- Note on decomposition of \(K _{n,n }\) into \((0,j)\)-prisms
- Decomposition of complete bipartite graphs into generalized prisms
- Decomposition of complete graphs into small generalized prisms
- Decomposition of complete graphs into \((0,2)\)-prisms.
- Note on factorization of complete bipartite multigraph into {\((0,j)\)}-prisms
- Decomposition of complete graphs into small bipartite prisms
This page was built for publication: Decomposition of certain complete bipartite graphs into prisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505465)