Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs

DOI10.1155/2021/5526335zbMath1477.05142OpenAlexW3206000571MaRDI QIDQ2051657

Haci Mehmet Baskonus, Shu Gong, Wei Gao

Publication date: 24 November 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/5526335

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• An extension of Tutte's 1-factor theorem
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• The extension degree conditions for fractional factor
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Sun toughness and $P_{\geq3}$-factors in graphs
• Remarks on path factors in graphs
• Toughness condition for a graph to be all fractional (g,f,n)-critical deleted

This page was built for publication: Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs