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


Covering odd cycles
Authors:János Komlós
Affiliation:(1) Department of Mathematics, Rutgers University, 08903 New Brunswick, NJ, U.S.A.
Abstract:We estimate the number of vertices/edges necessary to cover all odd cycles in graphs of given order and odd girth.To the memory of Pál Erdodblacs
Keywords:05C35  05C38
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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