典型文献
The Characterization of Graphs with No 2-connected Spanning Subgraph of V8 as a Minor
文献摘要：
It is difficult to characterize graphs which contain no a 2-connected graph as a minor in graph theory.Let V8 be a graph constructed from an 8-cycle by connecting the antipodal vertices.There are thirteen 2-connected spanning subgraphs of V8.In particular,one of them is obtained from the Petersen graph by deleting two vertices and it is also a hard problem to characterize Petersen-minor-free graphs.In this paper,we characterize internally 4-connected graphs which contain a 2-connected spanning subgraph of Vs as a forbidden minor.
文献关键词：
中图分类号：
作者姓名：
Xiao-min ZHOU;Xia-xia GUAN;Cheng-fu QIN;Wei-hua YANG
作者机构：
Department of Mathematics,Taiyuan University of Technology,Taiyuan 030000,China;School of Mathematical Sciences,Xiamen University,Xiamen 361005,China;School of Mathematics Science,Guangxi Teachers Education University,Nanning 530001,Chin
文献出处：
引用格式：
[1]Xiao-min ZHOU;Xia-xia GUAN;Cheng-fu QIN;Wei-hua YANG-.The Characterization of Graphs with No 2-connected Spanning Subgraph of V8 as a Minor)[J].应用数学学报（英文版）,2022(04):902-915
A类：
antipodal
B类：
Characterization,Graphs,No,connected,Spanning,Subgraph,V8,as,Minor,It,difficult,characterize,which,contain,minor,theory,Let,be,constructed,from,cycle,by,connecting,vertices,There,are,thirteen,spanning,subgraphs,In,particular,one,them,obtained,Petersen,deleting,two,also,hard,problem,free,this,paper,we,internally,Vs,forbidden
AB值：
0.545446
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
