Degree conditions for the existence of a {P2, P5}-factor in a graph

DOI10.1051/RO/2023111MaRDI QIDQ6140939

Su-fang Wang, Wei Zhang

Publication date: 22 January 2024

Published in: RAIRO - Operations Research (Search for Journal in Brave)

zbMATH Keywords

independence numberdegree condition\(\{P_2,P_5\}\)-factor

Mathematics Subject Classification ID

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

Related Items (3)

Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ The \(A_\alpha\)-spectral radius for path-factors in graphs

Cites Work

• Unnamed Item
• Star-factors with large components
• Component factors with large components in graphs
• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
• The existence of a path-factor without small odd paths
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Some results on path-factor critical avoidable graphs
• On path-factor critical deleted (or covered) graphs
• Path factors in subgraphs
• A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
• An odd \([ 1 , b \)-factor in regular graphs from eigenvalues]
• Research on fractional critical covered graphs
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• Two sufficient conditions for odd \([1,b\)-factors in graphs]
• Some sufficient conditions for path-factor uniform graphs
• On k-orthogonal factorizations in networks
• A Note of Generalization of Fractional ID-factor-critical Graphs
• Independence number and connectivity for fractional (a, b, k)-critical covered graphs
• Isolated toughness for path factors in networks
• Sufficient conditions for graphs with {P₂, P₅}-factors
• The existence of path-factor uniform graphs with large connectivity
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS

This page was built for publication: Degree conditions for the existence of a {P₂, P₅}-factor in a graph