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

DOI10.1051/ro/2022112zbMath1497.05214MaRDI 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 graph; degree sum; toughness; binding number; \(K_{1,r}\)-free graph; \(\{P_2, P_5\}\)-factor

Mathematics Subject Classification ID

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)