Sun toughness and path-factor uniform graphs

DOI10.1051/RO/2022201MaRDI QIDQ6186566zbMATH OpenOpenAlexFDO

Authors Hongxia Liu

Publication date 2 February 2024

Published in RAIRO - Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/ro/2022201

zbMATH Keywords

\(P_{\geq 3}\)-factor\(P_{\geq 3}\)-factor uniform graphconnectivityedge-connectivitysun toughness

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7774082
• Isolated toughness and path-factor uniform graphs. II.
• Isolated toughness and path-factor uniform graphs
• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• Sun toughness and \(P_{\geq3}\)-factors in graphs

Cites work

• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• A Note of Generalization of Fractional ID-factor-critical Graphs
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• An isolated toughness condition for graphs to be fractional (k, m)-deleted graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• Component factors with large components in graphs
• Fractional (g,f)-factors in graphs
• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
• Isolated toughness and path-factor uniform graphs. II.
• Isolated toughness for path factors in networks
• On k-orthogonal factorizations in networks
• On path-factor critical deleted (or covered) graphs
• Packing paths of length at least two
• Path factors and neighborhoods of independent sets in graphs
• Path factors in subgraphs
• Research on fractional critical covered graphs
• The binding number of a graph and its Anderson number
• The existence of path-factor uniform graphs with large connectivity
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• Toughness, isolated toughness and path factors in graphs

Cited in

(4)

• Spanning k-trees and distance signless Laplacian spectral radius of graphs
• Independence number and minimum degree for path-factor critical uniform graphs
• Characterizing spanning trees via the size or the spectral radius of graphs
• The path-factors and generalized distance spectral radius of graphs

This page was built for publication: Sun toughness and path-factor uniform graphs

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