Induced paths in 5-connected graphs
Induced paths in 5-connected graphs
复制标题
五连通图中的导出路径
作者：
M. Kriesell
我们证明了在一个5-连通图的任意两个顶点之间存在一条诱导路，它的顶点可以被去掉，使得剩余的图是2-连通的。©2000 John Wiley&Sons，Inc.《图论》36：52-58,2001
We show that between any two vertices of a 5-connected graph there exists an induced path whose vertices can be removed such that the remaining graph is 2-connected. © 2000 John Wiley & Sons, Inc. J Graph Theory 36: 52–58, 2001