Connectivity keeping trees in k‐connected graphs
Connectivity keeping trees in k‐connected graphs
复制标题
DOI：
10.1002/jgt.20585
复制
发表时间：
2012-03
影响因子：
0.9
通讯作者：
W. Mader
中科院分区：
文献类型：
--
作者：
W. Mader
我们证明，人们可以选择足够大的 k 连接图 G 的最小度（与 G 的顶点数无关），使得 G 包含指定树的副本 T，且具有 G − V(T) 保持 k 连接的属性。这是在[W. Mader，图论杂志 65 (2010)，61–69]。版权所有 © 2011 Wiley periodicals, Inc. J 图论 69: 324–329, 2012
We show that one can choose the minimum degree of a k‐connected graph G large enough (independent of the vertex number of G) such that G contains a copy T of a prescribed tree with the property that G − V(T) remains k‐connected. This was conjectured in [W. Mader, J Graph Theory 65 (2010), 61–69]. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 324–329, 2012