共查询到20条相似文献,搜索用时 578 毫秒
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
Kiyoshi Ando 《Discrete Mathematics》2018,341(11):3003-3009
An edge of a -connected graph is said to be -contractible if the contraction of the edge results in a -connected graph. If every -connected graph with no -contractible edge has either or as a subgraph, then an unordered pair of graphs is said to be a forbidden pair for -contractible edges. We prove that is a forbidden pair for 6-contractible edges, which is an extension of a previous result due to Ando and Kawarabayashi. 相似文献
13.
14.
15.
16.
17.
18.
19.
20.