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

作     者：ZHANG Yi-ran WANG Xiu-mei 张义冉;王秀梅

作者机构：School of Mathematics and StatisticsZhengzhou UniversityZhengzhou 450001China 

出 版 物：《Chinese Quarterly Journal of Mathematics》 (数学季刊（英文版）)

年 卷 期：2022年第37卷第4期

页      面：432-440页

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

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

主　　题：Perfect matching Cubic graph Claw-free graph Cycle-forced graph 

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