On free α-labelings of cubic bipartite graphs

It is known that an a-labeling of a bipartite graph G with n edges can be used to obtain a cyclic G-decomposition of K 2nx+1 for every positive integer x. It is also known that if two graphs G and H admit a free a-labeling, then their vertex-disjoint union also admits a free a-labeling. We show that...

全面介紹

Saved in:
書目詳細資料
Main Authors: Wannasiri Wannasit, Saad El-Zanati
格式: 雜誌
出版: 2018
主題:
在線閱讀:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84864831854&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/51795
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Chiang Mai University

相似書籍