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


Properly colored paths and cycles
Authors:Shinya Fujita  Colton Magnant
Affiliation:
  • a Department of Mathematics, Gunma National College of Technology, 580 Toriba, Maebashi, Gunma 371-8530, Japan
  • b Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA 30460, USA
  • Abstract:
    In an edge-colored graph, let dc(v) be the number of colors on the edges incident to v and let δc(G) be the minimum dc(v) over all vertices vG. In this work, we consider sharp conditions on δc(G) which imply the existence of properly edge-colored paths and cycles, meaning no two consecutive edges have the same color.
    Keywords:Properly colored cycles   Properly colored paths   Edge-colored graphs
    本文献已被 ScienceDirect 等数据库收录!
    设为首页 | 免责声明 | 关于勤云 | 加入收藏

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