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

DOI10.1051/RO/2023111MaRDI QIDQ6140939zbMATH OpenFDO

Authors Sufang Wang, Wei Zhang

Publication date 22 January 2024

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2023111

zbMATH Keywords

\(\{P_2,P_5\}\)-factordegree conditionindependence number

Mathematics Subject Classification ID

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

Recommendations

• Degree conditions for path-factors in graphs
• Sufficient conditions for graphs with {P₂, P₅}-factors
• The existence of a path-factor without small odd paths
• A degree sum condition for the existence of a path-factor.
• Degree sum conditions for path-factor uniform graphs

Cites work

• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• A Note of Generalization of Fractional ID-factor-critical Graphs
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
• Component factors with large components in graphs
• scientific article; zbMATH DE number 7691485 (Why is no real title available?)
• Independence number and connectivity for fractional \((a, b, k)\)-critical covered graphs
• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
• Isolated toughness for path factors in networks
• On k-orthogonal factorizations in networks
• On path-factor critical deleted (or covered) graphs
• Path factors in subgraphs
• Research on fractional critical covered graphs
• Some results on path-factor critical avoidable graphs
• Some sufficient conditions for path-factor uniform graphs
• Star-factors with large components
• Sufficient conditions for graphs with {P₂, P₅}-factors
• The existence of a path-factor without small odd paths
• The existence of path-factor uniform graphs with large connectivity
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• Toughness, isolated toughness and path factors in graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs

Cited in

(8)

• 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_-spectral radius for path-factors in graphs
• Distance signless Laplacian spectral radius for the existence of path-factors in graphs
• A spectral condition for component factors in graphs
• Degree conditions for path-factors in graphs
• Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices
• Binding number conditions for path-factor uniform graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6140939)