科研之友
微信
新浪微博
Facebook
分享链接
摘要
We provide a structural property of trees, which is applied to show that if a plane graph G contains two edge-disjoint spanning trees, then its dual graph G* has the vertex-arboricity at most 2. We also show that every maximal plane graph of order at least 4 contains two edge-disjoint spanning trees.
- 出版日期2017
- 单位上海财经大学
