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


Independent Trees in Planar Graphs Independent trees
Authors:Andreas Huck
Institution:Institute of Mathematics, University of Hannover, Welfengarten 1, 30167 Hannover, Germany. e-mail: huck@math.uni-hannover.de, DE
Abstract:We prove the following statement: Let G be a finite k-connected undirected planar graph and s be a vertex of G. Then there exist k spanning trees T1,…,Tk in G such that for each vertex xps of G, the k paths from x to s in T1,…,Tk are pairwise openly disjoint.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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