Tight toughness, isolated toughness and binding number bounds for the \K₂, C_n\-factors

DOI10.1007/S40305-023-00485-1MaRDI QIDQ6934520zbMATH OpenFDO

Authors Xiaxia Guan, Tianlong Ma, Chao Shi

Publication date 3 September 2025

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40305-023-00485-1

zbMATH Keywords

binding numbercomponent factorisolated toughnesstoughness

Mathematics Subject Classification ID

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

Cites work

• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Component factors with large components in graphs
• Fractional (g,f)-factors in graphs
• Fractional k-factors of graphs
• Graph Factors and Matching Extensions
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• Perfect matchings of a graph
• Perfect triangle-free 2-matchings
• Remarks on component factors
• The binding number of a graph and its Anderson number
• The existence of \(P_{\geq3}\)-factor covered graphs
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence of fractional k-factors of graphs
• Toughness condition for the existence of all fractional (a, b, k)-critical graphs

Cited in

(1)

• Sufficient conditions for component factors in a graph

This page was built for publication: Tight toughness, isolated toughness and binding number bounds for the \(\{K_2, C_n\}\)-factors

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