Characterizations of Cycle-Forced 2-Connected Claw-Free Cubic Graphs  

圈强迫的2-连通无爪三正则图的刻画

作　　者：ZHANG Yi-ran WANG Xiu-mei 张义冉;王秀梅(School of Mathematics and Statistics,Zhengzhou University,Zhengzhou 450001,China)

机构地区：[1]School of Mathematics and Statistics,Zhengzhou University,Zhengzhou 450001,China

出　　处：《Chinese Quarterly Journal of Mathematics》2022年第4期432-440,共9页数学季刊（英文版）

基　　金：Supported by National Natural Science Foundation of China(Grant Nos.12171440 and 11971445)。

摘　　要：Let G be a graph and C be an arbitrary even cycle of G.The graph G is called a cycle-forced graph if G-V(C)has a unique perfect matching.When C is an arbitrary induced even cycle of G,G is called an induced-cycle-forced graph.If G-V(C)has no perfect matching,G is said to be cycle-bad.This paper gives characterizations of these three type of graphs in the class of 2-connected claw-free cubic graphs.

关 键 词：Perfect matching Cubic graph Claw-free graph Cycle-forced graph 

分 类 号：O157.5[理学—数学]