{"title":"{Ck, Pk, Sk} -平衡完全二部多图的分解","authors":"Jenq-Jong Lin, Min-Jen Jou","doi":"10.4236/OJDM.2016.63015","DOIUrl":null,"url":null,"abstract":"Let be a family of subgraphs of a graph G. An L-decomposition of G is an edge-disjoint decomposition of G into positive integer copies of Hi, where . Let Ck, Pk and Sk denote a cycle, a path and a star with k edges, respectively. For an integer , we prove that a balanced complete bipartite multigraph has a -decomposition if and only if k is even, and .","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":"06 1","pages":"174-179"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"{Ck, Pk, Sk} -Decompositions of Balanced Complete Bipartite Multigraphs\",\"authors\":\"Jenq-Jong Lin, Min-Jen Jou\",\"doi\":\"10.4236/OJDM.2016.63015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let be a family of subgraphs of a graph G. An L-decomposition of G is an edge-disjoint decomposition of G into positive integer copies of Hi, where . Let Ck, Pk and Sk denote a cycle, a path and a star with k edges, respectively. For an integer , we prove that a balanced complete bipartite multigraph has a -decomposition if and only if k is even, and .\",\"PeriodicalId\":61712,\"journal\":{\"name\":\"离散数学期刊(英文)\",\"volume\":\"06 1\",\"pages\":\"174-179\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"离散数学期刊(英文)\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.4236/OJDM.2016.63015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"离散数学期刊(英文)","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.4236/OJDM.2016.63015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
{Ck, Pk, Sk} -Decompositions of Balanced Complete Bipartite Multigraphs
Let be a family of subgraphs of a graph G. An L-decomposition of G is an edge-disjoint decomposition of G into positive integer copies of Hi, where . Let Ck, Pk and Sk denote a cycle, a path and a star with k edges, respectively. For an integer , we prove that a balanced complete bipartite multigraph has a -decomposition if and only if k is even, and .