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


Tree‐width and circumference of graphs
Authors:Etienne Birmele
Abstract:We prove that every graph of circumference k has tree‐width at most k ? 1 and that this bound is best possible. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 24–25, 2003
Keywords:tree‐width  circumference
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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