The existence of path-factor uniform graphs with large connectivity

DOI10.1051/RO/2022143MaRDI QIDQ5104639zbMATH OpenOpenAlexFDO

Authors Qiuxiang Bian, Sizhong Zhou

Publication date 15 September 2022

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/2022143

zbMATH Keywords

\(P_{\geq 3}\)-factor\(P_{\geq 3}\)-factor uniform graphbinding numberdegree condition

Mathematics Subject Classification ID

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

Recommendations

• Some sufficient conditions for path-factor uniform graphs
• Isolated toughness and path-factor uniform graphs. II.
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Some existence theorems on path factors with given properties in graphs
• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs

Cited in

(24)

• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• The existence of path-factor covered graphs
• Some existence theorems on path factors with given properties in graphs
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Some sufficient conditions for path-factor uniform graphs
• An independent number condition for the existence of \(k\)-uniform graphs
• Isolated toughness and path-factor uniform graphs
• A Note of Generalization of Fractional ID-factor-critical Graphs
• Binding number for path-factor uniform graphs
• Path factors and neighborhoods of independent sets in graphs
• Isolated toughness and path-factor uniform graphs. II.
• Degree conditions for the existence of a {P₂, P₅}-factor in a graph
• Sufficient conditions for graphs to have strong parity factors
• Sun toughness and path-factor uniform graphs
• Path-factor critical covered graphs and path-factor uniform graphs
• \(\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
• Independence number and minimum degree for path-factor critical uniform graphs
• On path-factor critical uniform graphs
• Degree sum conditions for path-factor uniform graphs
• Binding number conditions for path-factor uniform graphs

This page was built for publication: The existence of path-factor uniform graphs with large connectivity

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