Toughness and isolated toughness conditions for P_ 3-factor uniform graphs

DOI10.1007/S12190-020-01462-0MaRDI QIDQ2053255zbMATH OpenOpenAlexFDO

Authors Hongbo 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

\(P_{\geq 3}\)-factor uniform graphisolated toughnesspath factortoughness

Mathematics Subject Classification ID

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

Recommendations

• Isolated toughness and path-factor uniform graphs. II.
• Isolated toughness and path-factor uniform graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• On \(P_{\geq 3}\)-factor deleted graphs
• The existence of path-factor uniform graphs with large connectivity

Cites work

• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• Fractional (g,f)-factors in graphs
• scientific article; zbMATH DE number 3720956 (Why is no real title available?)
• scientific article; zbMATH DE number 3893247 (Why is no real title available?)
• Packing paths of length at least two
• Partitioning vertices of 1-tough graphs into paths
• The existence of \(P_{\geq3}\)-factor covered graphs
• Tough graphs and Hamiltonian circuits.

Cited in

(16)

• (3, k)-factor-critical graphs and toughness
• On \(P_{\geq 3}\)-factor deleted graphs
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Some sufficient conditions for path-factor uniform graphs
• Isolated toughness and path-factor uniform graphs
• The existence of path-factor uniform graphs with large connectivity
• Binding number for path-factor uniform graphs
• Path factors and neighborhoods of independent sets in graphs
• Binding number and path-factor critical deleted graphs
• Isolated toughness and path-factor uniform graphs. II.
• Sun toughness and path-factor uniform graphs
• Degree sum conditions for path-factor uniform graphs
• Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices
• A distance spectral radius for star-factors with large components in graphs
• Binding number conditions for path-factor uniform graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053255)