TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS

DOI10.1017/S0004972721000952zbMath1497.05227OpenAlexW4200420925MaRDI QIDQ5867854

Jian-Cheng Wu, Si-zhong Zhou, Yang Xu

Publication date: 19 September 2022

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972721000952

zbMATH Keywords

toughnessisolated toughness\(P_{\geq 3}\)-factor\((P_{\geq 3},k)\)-factor-critical covered graph

Mathematics Subject Classification ID

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

Related Items

Discussion on fractional \((a, b, k)\)-critical covered graphs, Discussions on orthogonal factorizations in digraphs, A Note of Generalization of Fractional ID-factor-critical Graphs, Some results about ID-path-factor critical graphs, Packing 2- and 3-stars into cubic graphs, Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor, 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., Two sufficient conditions for odd \([1,b\)-factors in graphs], Degree conditions for the existence of a {P₂, P₅}-factor in a graph, Sufficient conditions for graphs to have strong parity factors, The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices, Sun toughness and path-factor uniform graphs, Path-factor critical covered graphs and path-factor uniform graphs, The \(A_\alpha\)-spectral radius for path-factors in graphs, Some sufficient conditions for path-factor uniform graphs, Tight isolated toughness bound for fractional \((k, n)\)-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Packing 3-vertex paths in claw-free graphs and related topics
• Path factors and parallel knock-out schemes of almost claw-free graphs
• 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
• Toughness of graphs and the existence of factors
• Packing paths of length at least two
• Component factors and binding number conditions in graphs
• Path factors in subgraphs
• A toughness condition for fractional \((k, m)\)-deleted graphs revisited
• The existence of \(P_{\geq3}\)-factor covered graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Tough graphs and Hamiltonian circuits.
• New isolated toughness condition for fractional $(g,f,n)$-critical graphs
• Remarks on path factors in graphs
• Toughness and the existence ofk-factors
• Isolated toughness and path-factor uniform graphs
• Some results about component factors in graphs
• Toughness condition for a graph to be all fractional (g,f,n)-critical deleted