Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/76887Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Peter Adams | en_US |
| dc.contributor.author | Ryan C. Bunge | en_US |
| dc.contributor.author | Roger B. Eggleton | en_US |
| dc.contributor.author | Saad I. Eı-Zanati | en_US |
| dc.contributor.author | Ugur Odabaşı | en_US |
| dc.contributor.author | Wannasiri Wannasit | en_US |
| dc.date.accessioned | 2022-10-16T07:19:47Z | - |
| dc.date.available | 2022-10-16T07:19:47Z | - |
| dc.date.issued | 2021-01-01 | en_US |
| dc.identifier.issn | 26890674 | en_US |
| dc.identifier.issn | 11831278 | en_US |
| dc.identifier.other | 2-s2.0-85109430487 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85109430487&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/76887 | - |
| dc.description.abstract | There are ten bipartite cubic graphs of order n < 12. For each such graph G we give necessary and sufficient conditions for the existence of decompositions of Kn and of Km, n into copies of G. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12 | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Bulletin of the Institute of Combinatorics and its Applications | en_US |
| article.volume | 92 | en_US |
| article.stream.affiliations | Illinois State University | en_US |
| article.stream.affiliations | The University of Queensland | en_US |
| article.stream.affiliations | The University of Newcastle, Australia | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| Appears in Collections: | CMUL: Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.