南京师大学报（自然科学版）2023，Vol.46Issue(4)：11-16,6.DOI:10.3969/j.issn.1001-4616.2023.04.003
路因子临界覆盖图存在的若干充分条件
The Sufficient Conditions for the Existence of Path-Factor Critical Covered Graphs
摘要
Abstract
Let G be a graph.A spanning subgraph F of G is called a path factor if each component of F is a path.Denote by P≥t-factor the path factor each component of which admits at least t vertices.We say that G is P≥t-factor covered if G has a P≥t-factor containing e for any e ∈ E(G).For arbitrary S⊆ V(G)with | S|=k,if C-S is P≥f-factor covered,then we say G is P≥t-factor-critical covered.In this paper,we present sufficient conditions for graphs to be P≥t-factor-critical covered and construct counterexamples to show that the bounds are best possible in some sense.关键词
联结数/连通度/路因子/P≥t-因子/P≥t-因子临界覆盖图Key words
Binding number/connectivity/path factor/P≥t-factor/P≥t-factor-critical covered graph分类
数理科学引用本文复制引用
袁园..路因子临界覆盖图存在的若干充分条件[J].南京师大学报（自然科学版）,2023,46(4):11-16,6.基金项目
海南省自然科学基金青年基金项目(120QN176)、海南大学科研启动基金项目(KYQD(ZR)19101). （120QN176）
