期刊
DISCRETE MATHEMATICS
卷 312, 期 4, 页码 808-810出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.disc.2011.11.015
关键词
Independent spanning trees; Interconnection networks; Plane graphs; Tutte graph
类别
资金
- National Development Agency of Hungary [CK 80124]
For each k >= 2, we construct a k-connected graph which does not contain two completely independent spanning trees. This disproves a conjecture of Hasunuma. Furthermore, we also give an example of a 3-connected maximal plane graph not containing two completely independent spanning trees. (C) 2011 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据