Tight binding number bound for P_ 3-factor uniform graphs

DOI10.1016/J.IPL.2021.106162MaRDI QIDQ2234788zbMATH OpenOpenAlexFDO

Authors Wei Gao, Weifan Wang

Publication date 19 October 2021

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2021.106162

zbMATH Keywords

\(P_{\geq k}\)-factor uniform graphbinding numbercombinatorial problemspath factor

Mathematics Subject Classification ID

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

Recommendations

• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Isolated toughness and path-factor uniform graphs. II.
• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• The existence of path-factor uniform graphs with large connectivity
• Some sufficient conditions for path-factor uniform 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
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Binding numbers and restricted fractional ( g , f )-factors in graphs
• Binding numbers for fractional \((a, b, k)\)-critical covered graphs
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• Graph theory
• Remarks on path factors in graphs
• Research on fractional critical covered graphs
• Some existence theorems on path factors with given properties in graphs
• Some results about component factors in graphs
• The binding number of a graph and its Anderson number

Cited in

(16)

• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Some sufficient conditions for path-factor uniform graphs
• scientific article; zbMATH DE number 7774082 (Why is no real title available?)
• Binding number for path-factor uniform graphs
• Path factors and neighborhoods of independent sets in graphs
• Isolated toughness and path-factor uniform graphs. II.
• Degree conditions for the existence of a {P₂, P₅}-factor in a graph
• Sufficient conditions for graphs to have strong parity factors
• Sun toughness and path-factor uniform graphs
• Independence number and minimum degree for path-factor critical uniform graphs
• Characterizing spanning trees via the size or the spectral radius of graphs
• On path-factor critical uniform graphs
• The path-factors and generalized distance spectral radius of graphs
• Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices
• Binding number conditions for path-factor uniform graphs

This page was built for publication: Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs

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