Remarks on component factors in K1,r-free graphs

DOI10.1051/ro/2023042zbMath1514.05128arXiv2012.06359MaRDI QIDQ6045046

Zan-Bo Zhang, Xiaoyan Zhang, Guowei Dai

Publication date: 26 May 2023

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

Full work available at URL: https://arxiv.org/abs/2012.06359

zbMATH Keywords

minimum degree; \(K_{1,r}\)-free; \(\mathcal{P}_{\geq k}\)-factor; \(\mathcal{P}_{\geq k}\)-factor covered graph; \(\mathcal{S}_n\)-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.)