Some degree conditions for 𝒫≥k-factor covered graphs

DOI10.1051/ro/2021140zbMath1483.05130OpenAlexW3200832130MaRDI QIDQ5034714

Xiaoyan Zhang, Yicheng Hang, Zan-Bo Zhang, Guowei Dai

Publication date: 21 February 2022

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

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

zbMATH Keywords

minimum degreeplanar graph\(\mathcal{P}_{\geq 2}\)-factor covered graph\(\mathcal{P}_{\geq 3}\)-factor covered graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items

Binding number and path-factor critical deleted graphs ⋮ Path-factor critical covered graphs and path-factor uniform graphs