Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs

DOI10.1016/j.disc.2019.111715zbMath1435.05166OpenAlexW2984793906MaRDI QIDQ2286579

Zhi-ren Sun, Si-zhong Zhou

Publication date: 22 January 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.111715

zbMATH Keywords

path factorbinding number\(P_{\geq 3}\)-factor uniform graph\(P_{\geq 2}\)-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 (19)

The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ A neighborhood condition for graphs to have restricted fractional (g,f)-factors ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ Remarks on component factors ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius ⋮ Sun toughness and path-factor uniform graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ Some sufficient conditions for path-factor uniform graphs ⋮ Research on fractional critical covered graphs ⋮ A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs ⋮ Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs ⋮ Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs ⋮ Some results on path-factor critical avoidable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Generalizations of marriage theorem for degree factors
• 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
• Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
• Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
• Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
• Packing paths of length at least two
• Characterization of forbidden subgraphs for the existence of even factors in a graph
• A note on \(m\)-near-factor-critical graphs
• Remarks on fractional ID-\(k\)-factor-critical graphs
• A result on \(r\)-orthogonal factorizations in digraphs
• Remarks on orthogonal factorizations of digraphs
• Some results about component factors in graphs

This page was built for publication: Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs