Binding number conditions for P_ 2-factor and P_ 3-factor uniform graphs

DOI10.1016/J.DISC.2019.111715zbMATH Open1435.05166OpenAlexW2984793906MaRDI QIDQ2286579FDOQ2286579

Authors: Zhiren Sun, Sizhong 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

Recommendations

• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• The existence of path-factor uniform graphs with large connectivity
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• Some sufficient conditions for path-factor uniform graphs
• Isolated toughness and path-factor uniform graphs. II.

zbMATH Keywords

binding numberpath factor\(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)

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
• Title not available (Why is that?)
• Generalizations of marriage theorem for degree factors
• Packing paths of length at least two
• Characterization of forbidden subgraphs for the existence of even factors in a graph
• Some results about component factors in graphs
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
• A result on \(r\)-orthogonal factorizations in digraphs
• Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
• Remarks on orthogonal factorizations of digraphs
• Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
• Remarks on fractional ID-\(k\)-factor-critical graphs
• An isolated toughness condition for graphs to be fractional (\(k, m\))-deleted graphs
• A note on \(m\)-near-factor-critical graphs

Cited In (28)

• Path-factor critical covered graphs and path-factor uniform graphs
• A degree condition for fractional \((g, f, n)\)-critical covered graphs
• On fractional \((g, f, n^\prime, m)\)-critical covered graphs
• Remarks on component factors
• Some sufficient conditions for path-factor uniform graphs
• The existence of subdigraphs with orthogonal factorizations in digraphs
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
• Some results on path-factor critical avoidable graphs
• Toughness for fractional \((2, b, k)\)-critical covered graphs
• Research on fractional critical covered graphs
• A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
• Binding numbers and restricted fractional \(( g , f )\)-factors in 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
• Title not available (Why is that?)
• Binding number for path-factor uniform graphs
• Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs
• A neighborhood condition for graphs to have restricted fractional (g,f)-factors
• The existence of path-factor uniform graphs with large connectivity
• Binding number, odd \([1, b]\)-factors and the distance spectral radius
• Degree sum conditions for path-factor uniform graphs
• On path-factor critical uniform graphs
• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• Some results about component factors in graphs
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors

This page was built for publication: Binding number conditions for \(P_{\geq 2}\)-factor and \(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 Q2286579)