典型文献
Characterizations of Cycle-Forced 2-Connected Claw-Free Cubic Graphs
文献摘要：
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.
文献关键词：
中图分类号：
作者姓名：
ZHANG Yi-ran;WANG Xiu-mei
作者机构：
School of Mathematics and Statistics,Zhengzhou University,Zhengzhou 450001,China
文献出处：
引用格式：
[1]ZHANG Yi-ran;WANG Xiu-mei-.Characterizations of Cycle-Forced 2-Connected Claw-Free Cubic Graphs)[J].数学季刊（英文版）,2022(04):432-440
A类：
Claw
B类：
Characterizations,Cycle,Forced,Connected,Free,Cubic,Graphs,Let,be,arbitrary,even,cycle,called,forced,if,has,unique,perfect,matching,When,induced,If,no,said,bad,This,paper,gives,characterizations,these,three,type,graphs,class,connected,claw,free,cubic
AB值：
0.583619
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
