图的扩充核与可选性
Extended core and choosability of a graph
摘要:
图$G$是$(a,b)$可选择的,如果对于与每个顶点相关联的大小为$a$的任何颜色列表,可以选择$b$颜色的子集,使得相邻的顶点用不相交的颜色集着色。本文证明了图的$(a,b)$ -可选性与它的一个称为扩展核的子图的$(a,b)$ -可选性之间的等价性。作为一个应用,证明了三角格的无三角诱导子图的$(5,2)$ -可选择性和$(7,3)$ -可着色性.
英文摘要:
A graph $G$ is $(a,b)$-choosable if for any color list of size $a$ associated with each vertices, one can choose a subset of $b$ colors such that adjacent vertices are colored with disjoint color sets. This paper shows an equivalence between the $(a,b)$-choosability of a graph and the $(a,b)$-choosability of one of its subgraphs called the extended core. As an application, this result allows to prove the $(5,2)$-choosability and $(7,3)$-colorability of triangle-free induced subgraphs of the triangular lattice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。