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


The square of a connected S(K1,3)-free graph is vertex pancyclic
Authors:George Hendry  Walter Vogler
Abstract:We prove the conjecture of Gould and Jacobson that a connected S(K1,3)-free graph has a vertex pancyclic square. Since S(K1,3)2 is not vertex pan-cyclic, this result is best possible.
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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