Some existence theorems on path factors with given properties in graphs

DOI10.1007/s10114-020-9224-5zbMath1447.05177OpenAlexW2999068088WikidataQ126320523 ScholiaQ126320523MaRDI QIDQ2199110

Zhi-ren Sun, Si-zhong Zhou

Publication date: 16 September 2020

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-020-9224-5

zbMATH Keywords

binding number, \(P_{\geq 2}\)-factor, \(P_{\geq 3}\)-factor, \((P_{\geq 2}, k)\)-factor-critical covered graph, \((P_{\geq 3}, k)\)-factor-critical covered graph

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ On path-factor critical deleted (or covered) graphs ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ Binding number and path-factor critical deleted graphs ⋮ The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices ⋮ 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 ⋮ Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Some results on path-factor critical avoidable graphs

Cites Work

• Unnamed Item
• A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
• Packing 3-vertex paths in claw-free graphs and related topics
• Component factors with large components in graphs
• Path factors and parallel knock-out schemes of almost claw-free graphs
• On path factors of \((3,4)\)-biregular bigraphs
• 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
• Packing paths of length at least two
• Parameters and fractional factors in different settings
• A toughness condition for fractional \((k, m)\)-deleted graphs revisited
• Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Degree sum conditions for path-factors with specified end vertices in bipartite graphs
• A toughness condition for fractional \((k,m)\)-deleted graphs
• Toughness, binding number and restricted matching extension in a graph
• The existence of \(P_{\geq3}\)-factor covered graphs
• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• Remarks on orthogonal factorizations of digraphs
• Remarks on path factors in graphs
• Path and cycle factors of cubic bipartite graphs
• Path factors in cubic graphs
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Some results about component factors in graphs
• Some new sufficient conditions for graphs to have fractionalk-factors
• The binding number of a graph and its Anderson number

This page was built for publication: Some existence theorems on path factors with given properties in graphs