The existence of path-factor uniform graphs with large connectivity

DOI10.1051/ro/2022143zbMath1497.05225OpenAlexW4291010301MaRDI QIDQ5104639

Qiuxiang Bian, Si-zhong Zhou

Publication date: 15 September 2022

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

Full work available at URL: https://doi.org/10.1051/ro/2022143

zbMATH Keywords

degree conditionbinding number\(P_{\geq 3}\)-factor uniform graph\(P_{\geq 3}\)-factor

Mathematics Subject Classification ID

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

Related Items (8)

A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ 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_\alpha\)-spectral radius for path-factors in graphs

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