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


The crossing number of K1,3,n and K2,3,n
Authors:Kouhei Asano
Abstract:In this article, we will determine the crossing number of the complete tripartite graphs K1,3,n and K2,3,n. Our proof depends on Kleitman's results for the complete bipartite graphs D. J. Kleitman, The crossing number of K5,n. J. Combinatorial Theory 9 (1970) 315-323].
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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