Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs

DOI10.1007/S12190-020-01462-0zbMath1475.05097OpenAlexW3104438296MaRDI QIDQ2053255

Hong-Bo Hua

Publication date: 29 November 2021

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-020-01462-0

zbMATH Keywords

toughnesspath factorisolated toughness\(P_{\geq 3}\)-factor uniform graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (3)

Path factors and neighborhoods of independent sets in graphs ⋮ Binding number and path-factor critical deleted graphs ⋮ Some sufficient conditions for path-factor uniform graphs

Cites Work

• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Packing paths of length at least two
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• The existence of \(P_{\geq3}\)-factor covered graphs
• Tough graphs and Hamiltonian circuits.
• Partitioning vertices of 1-tough graphs into paths
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs