Isolated toughness and P_ 3-factors in graphs

MaRDI QIDQ5133255zbMATH OpenFDO

Authors Sizhong Zhou, Zhiren Sun

Publication date 12 November 2020

zbMATH Keywords

\(P_{\ge n},k\)-factor critical graph\(P_{\ge n},m\)-factor deleted graph\(P_{\ge n}\)-factorconnectivityisolated toughness

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Deterministic network models in operations research (90B10)

Recommendations

• On \(P_{\geq 3}\)-factor deleted graphs
• Remarks on path factors in graphs
• Toughness and isolated toughness conditions for path-factor critical covered graphs
• Toughness, isolated toughness and path factors in graphs
• Path factors in subgraphs

Cited in

(9)

• (3, k)-factor-critical graphs and toughness
• Some results on path-factor critical avoidable graphs
• On \(P_{\geq 3}\)-factor deleted graphs
• Path factors in subgraphs
• Sun toughness and \(P_{\geq3}\)-factors in graphs
• Toughness, isolated toughness and path factors in graphs
• Independence number, minimum degree and path-factors in graphs
• Binding number and path-factor critical deleted graphs
• Tight toughness bounds for path-factor critical avoidable graphs

This page was built for publication: Isolated toughness and \(P_{\ge 3}\)-factors in graphs

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