Contractible Subgraphs in 3-Connected Graphs
Contractible Subgraphs in 3-Connected Graphs
复制标题
三连通图中的可收缩子图
DOI:
10.1006/jctb.2000.1960
复制
发表时间:
2000
期刊:
影响因子:
--
通讯作者:
M. Kriesell
中科院分区:
文献类型:
--
作者:
M. Kriesell
A subgraph H of a 3-connected finite graph G is called contractible if H is connected and G?V(H) is 2-connected. This work is concerned with a conjecture of McCuaig and Ota which states that for any given k there exists an f(k) such that any 3-connected graph on at least f(k) vertices possesses a contractible subgraph on k vertices. We prove this for k?4 and consider restrictions to maximal planar graphs, Halin graphs, line graphs of 6-edge-connected graphs, 5-connected graphs of bounded degree, and AT-free graphs.