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: | , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84864831854&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/51795 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |