首页 | 本学科首页   官方微博 | 高级检索  
     


Multicolored parallelisms of Hamiltonian cycles
Authors:Hung-Lin Fu  Yuan-Hsun Lo
Affiliation:Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30050, Taiwan
Abstract:A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we prove that a complete graph on 2m+1 vertices K2m+1 can be properly edge-colored with 2m+1 colors in such a way that the edges of K2m+1 can be partitioned into m multicolored Hamiltonian cycles.
Keywords:Complete graph   Multicolored Hamiltonian cycles   Parallelism
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号