arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.12706math.CO
收藏

关于可平面图是5-柔性的充分条件

On sufficient conditions for planar graphs to be 5-flexible

Fan Yang

摘要:

本文研究了两类平面图类$\mathcal{H}_1$,$\mathcal{H}_2$的柔性,其中$\mathcal{H}_1$,$\mathcal{H}_2$分别表示所有无跳可平面图和所有无屋可平面图的集合.设$G$是一个可平面图,其列表赋值为$L$ .假设为某些顶点给定了首选颜色。我们证明,如果$G\in \mathcal{H}_1$或$G\in \mathcal{H}_2$,使所有列表的大小至少$5$,那么存在一个$L$着色尊重至少一个常数的偏好。

英文摘要:

In this paper, we study the flexibility of two planar graph classes $\mathcal{H}_1$, $\mathcal{H}_2$, where $\mathcal{H}_1$, $\mathcal{H}_2$ denote the set of all hopper-free planar graphs and house-free planar graphs, respectively. Let $G$ be a planar graph with a list assignment $L$. Suppose a preferred color is given for some of the vertices. We prove that if $G\in \mathcal{H}_1$ or $G\in \mathcal{H}_2$ such that all lists have size at least $5$, then there exists an $L$-coloring respecting at least a constant fraction of the preferences.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑