Remarks on path-factor critical avoidable graphs
Zhou (2023) introduced the concept of path-factor critical avoidable graph and determined several parameter bounds for (P≥2,n) or (P≥3,n)-factor critical avoidable graphs. Certain instances are listed in Zhou (2023) to show that these toughness or isolated toughness bounds are sharp. However, the de...
Main Authors: | Zhengyue He, Li Liang, Haci Mehmet Baskonus, Wei Gao |
---|---|
Format: | Article |
Language: | English |
Published: |
KeAi Communications Co., Ltd.
2023-06-01
|
Series: | International Journal of Cognitive Computing in Engineering |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2666307423000074 |
Similar Items
-
Decomposing 10-Regular Graphs into Paths of Length 5
by: Xie Mengmeng, et al.
Published: (2022-11-01) -
Disjoint triangles and quadrilaterals in a graph
by: Wang Hong
Published: (2008-12-01) -
On path-cycle decompositions of triangle-free graphs
by: Andrea Jiménez, et al.
Published: (2017-10-01) -
Some Results on Path-Factor Critical Avoidable Graphs
by: Zhou Sizhong
Published: (2023-02-01) -
Binding number and path-factor critical deleted graphs
by: Yuan Chen, et al.
Published: (2022-09-01)