Tight toughness bounds for path-factor critical avoidable graphs

DOI10.1080/09728600.2024.2314512MaRDI QIDQ6643349

Guowei Dai, Wen-qi Wang

Publication date: 26 November 2024

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• 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
• The existence of path-factor covered graphs
• Some results on path-factor critical avoidable graphs
• On path-factor critical deleted (or covered) graphs
• The existence of \(P_{\geq3}\)-factor covered graphs
• Tough graphs and Hamiltonian circuits.
• \(P_3\)-factors in the square of a tree
• On packing 3-vertex paths in a graph
• Graph Factors and Matching Extensions
• Path and cycle factors of cubic bipartite graphs
• Sufficient conditions for the existence of a path‐factor which are related to odd components
• Some degree conditions for 𝒫_≥k-factor covered graphs
• Remarks on component factors in graphs
• Isolated toughness for path factors in networks
• Sufficient conditions for graphs with {P₂, P₅}-factors
• The Factors of Graphs
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
• Path factors in claw-free graphs
• Path factors and neighborhoods of independent sets in graphs
• Binding number and path-factor critical deleted graphs
• Path-factor critical covered graphs and path-factor uniform graphs

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