图的度约束2-分拆
Degree-constrained 2-partitions of graphs
摘要:
图$G$的$(δ\geq k_1,δ\geq k_2)$ -划分是$G$的顶点划分$(V_1,V_2)$满足$i=1,2$的$δ(G[V_i])\geq k_i$。我们确定,对于所有的正整数$k_1,k_2$,决定一个给定的图是否有一个$(δ\geq k_1,δ\geq k_2)$ -分区的复杂性。我们还解决的问题,找到一个功能$g(k_1,k_2)$,使$(δ\geq k_1,δ\geq k_2)$ -分区问题是${\cal NP}$ -完全的最低程度小于$g(k_1,k_2)$和多项式的所有图的最低程度至少$g(k_1,k_2)$的图类。我们证明了$k\ge 3$的$g(1,k)=k$、$g(2,2)=3$和$g(2,3)$(如果存在)的值为4或5。
英文摘要:
A $(δ\geq k_1,δ\geq k_2)$-partition of a graph $G$ is a vertex-partition $(V_1,V_2)$ of $G$ satisfying that $δ(G[V_i])\geq k_i$ for $i=1,2$. We determine, for all positive integers $k_1,k_2$, the complexity of deciding whether a given graph has a $(δ\geq k_1,δ\geq k_2)$-partition. We also address the problem of finding a function $g(k_1,k_2)$ such that the $(δ\geq k_1,δ\geq k_2)$-partition problem is ${\cal NP}$-complete for the class of graphs of minimum degree less than $g(k_1,k_2)$ and polynomial for all graphs with minimum degree at least $g(k_1,k_2)$. We prove that $g(1,k)=k$ for $k\ge 3$, that $g(2,2)=3$ and that $g(2,3)$, if it exists, has value 4 or 5.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。