Tight toughness bounds for path-factor critical avoidable graphs

DOI10.1080/09728600.2024.2314512MaRDI QIDQ6643349zbMATH OpenFDO

Authors Wen-qi Wang, Guowei Dai

Publication date 26 November 2024

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1080/09728600.2024.2314512

Mathematics Subject Classification ID

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

Recommendations

• Some results on path-factor critical avoidable graphs
• Some existence theorems on path-factor critical avoidable graphs
• Toughness and isolated toughness conditions for path-factor critical covered graphs
• Toughness, isolated toughness and path factors in graphs
• Isolated toughness and \(P_{\ge 3}\)-factors in graphs

Cites work

• \(P_3\)-factors in the square of a tree
• 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 and path-factor critical deleted graphs
• Binding number for path-factor uniform graphs
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• Factors and factorizations of graphs. Proof techniques in factor theory
• Fractional (g,f)-factors in graphs
• Graph Factors and Matching Extensions
• scientific article; zbMATH DE number 4033791 (Why is no real title available?)
• Isolated toughness for path factors in networks
• On packing 3-vertex paths in a graph
• On path-factor critical deleted (or covered) graphs
• Path and cycle factors of cubic bipartite graphs
• Path factors and neighborhoods of independent sets in graphs
• Path factors in claw-free graphs
• Path-factor critical covered graphs and path-factor uniform graphs
• Remarks on component factors in graphs
• Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs
• Some results on path-factor critical avoidable graphs
• Sufficient conditions for graphs with {P₂, P₅}-factors
• Sufficient conditions for the existence of a path-factor which are related to odd components
• The existence of \(P_{\geq3}\)-factor covered graphs
• The existence of path-factor covered graphs
• The Factors of Graphs
• Tough graphs and Hamiltonian circuits.
• Toughness, isolated toughness and path factors in graphs

Cited in

(1)

• Some existence theorems on path-factor critical avoidable graphs

This page was built for publication: Tight toughness bounds for path-factor critical avoidable graphs

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