Sufficient conditions for graphs with {P2, P5}-factors

DOI10.1051/RO/2022112zbMath1497.05214OpenAlexW4283464296MaRDI QIDQ5104638

Xiaoyan Zhang, Zan-Bo Zhang, Yicheng Hang, Guowei Dai, Wen-qi Wang

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

zbMATH Keywords

regular graphdegree sumtoughnessbinding number\(K_{1,r}\)-free graph\(\{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) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Degree conditions for the existence of a {P₂, P₅}-factor in a graph

This page was built for publication: Sufficient conditions for graphs with {P₂, P₅}-factors