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

	#br#

doi:10.13371/j.cnki.chin.q.j.m.2022.04.012

数学季刊 ›› 2022, Vol. 37 ›› Issue (4): 432-440.doi: 10.13371/j.cnki.chin.q.j.m.2022.04.012

• • 上一篇

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

School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China

收稿日期:2022-11-14 出版日期:2022-12-30 发布日期:2022-12-30
通讯作者: ZHANG Yi-ran (1996-), female, native of Zhengzhou, Henan, student of Zhengzhou University, engages in graph theory; E-mail:zhangyiran1125@163.com
作者简介:ZHANG Yi-ran (1996-), female, native of Zhengzhou, Henan, student of Zhengzhou University, engages in graph theory; WANG Xiu-mei (1972-), female, native of Zhengzhou, Henan, professor of Zhengzhou University, Ph.D supervisor, Ph.D, engages in graph theory.
基金资助:
Supported by National Natural Science Foundation of China (Grant Nos. 12171440 and 11971445).

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

School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China

Received:2022-11-14 Online:2022-12-30 Published:2022-12-30
Contact: ZHANG Yi-ran (1996-), female, native of Zhengzhou, Henan, student of Zhengzhou University, engages in graph theory; E-mail:zhangyiran1125@163.com
About author:ZHANG Yi-ran (1996-), female, native of Zhengzhou, Henan, student of Zhengzhou University, engages in graph theory; WANG Xiu-mei (1972-), female, native of Zhengzhou, Henan, professor of Zhengzhou University, Ph.D supervisor, Ph.D, engages in graph theory.
Supported by:
Supported by National Natural Science Foundation of China (Grant Nos. 12171440 and 11971445).

摘要/Abstract

摘要： 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

Abstract: 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.

Key words: Perfect matching, Cubic graph, Claw-free graph, Cycle-forced graph

中图分类号:

O157.5

张义冉, 王秀梅. 圈强迫的2-连通无爪三正则图的刻画#br#

#br#

[J]. 数学季刊, 2022, 37(4): 432-440.

ZHANG Yi-ran, WANG Xiu-mei. Characterizations of Cycle-Forced 2-Connected Claw-Free Cubic Graphs[J]. Chinese Quarterly Journal of Mathematics, 2022, 37(4): 432-440.

[1]	张庆楠, 惠志昊, 杨雨, 王安. 哈林图的导出匹配可扩性[J]. 数学季刊, 2022, 37(4): 380-385.
[2]	鲁晓旭, 李静, 吴敏. 关于元爪图的一个性质[J]. 数学季刊, 2011, 26(3): 445-447.

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

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

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 2

编辑推荐

Metrics

本文评价