Sun toughness and P₃-factors in graphs

DOI10.11575/CDM.V14I1.62676zbMATH Open1444.05115OpenAlexW3120612562MaRDI QIDQ3299358FDOQ3299358

Authors: Sizhong Zhou 

Publication date: 22 July 2020

Full work available at URL: https://cdm.ucalgary.ca/article/download/62676/53784

Recommendations

• On path-factor critical deleted (or 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
• Toughness and isolated toughness conditions for path-factor critical covered graphs
• On \(P_{\geq 3}\)-factor deleted graphs
• Isolated toughness and \(P_{\ge 3}\)-factors in graphs

zbMATH Keywords

sun toughness\(P_{\geq3}\)-factor\(P_{\geq3}\)-factor covered graph\(P_{\geq3}\)-factor deleted graph

Mathematics Subject Classification ID

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

Cited In (9)

• A degree condition for fractional \((g, f, n)\)-critical covered graphs
• Research on fractional critical covered graphs
• A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
• Sun toughness and path-factor uniform graphs
• Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs
• Some results about star-factors in graphs
• On graph-based network parameters and component factors in networks
• Degree sum conditions for path-factor uniform graphs
• On path-factor critical deleted (or covered) graphs

This page was built for publication: Sun toughness and \(P_{\geq3}\)-factors in graphs

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