1. IR @ Alliance University
  2. Journal Articles Archive
  3. Articles to be qced
Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7632
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRoger B. Eggleton-
dc.date.accessioned2024-02-27T06:20:37Z-
dc.date.available2024-02-27T06:20:37Z-
dc.date.issued2005-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7632-
dc.description.abstractThe order 6 complete multipartite graph K6<2 > in which every edge has multiplicity 2 admits a decomposition into one copy of each of the six trees of order 6. The order 6 complete digraph D6 admits a decomposition into the six trees of order 6 wherein each tree is rooted and all edges are oriented away from the root, and each vertex of D6 is the root of exactly one of these trees. There are similar decompositions of K4<2> and D4-
dc.publisherBulletin of the Institute of Combinatorics and Its Applications-
dc.titleSpecial Heterogeneous Decompositions into Spanning Trees-
dc.volVol 43-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
Special Heterogeneous Decompositions.pdf
  Restricted Access		894.71 kBAdobe PDFView/Open Request a copy
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.