Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs

DOI10.1016/j.ipl.2021.106162zbMath1476.05168OpenAlexW3182225709MaRDI QIDQ2234788

Wei Gao, Wei Fan 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

combinatorial problemspath factorbinding number\(P_{\geq k}\)-factor uniform graph

Mathematics Subject Classification ID

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

Related Items (7)

Path factors and neighborhoods of independent sets in 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 ⋮ Sun toughness and path-factor uniform graphs ⋮ Some sufficient conditions for path-factor uniform graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Some existence theorems on path factors with given properties in graphs
• Research on fractional critical covered graphs
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Remarks on path factors in graphs
• Some results about component factors in graphs
• The binding number of a graph and its Anderson number

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