Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8

Dvorak Zdenek; Postle Luke

首页> 外文期刊>Journal of Combinatorial Theory, Series B >Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8

【24h】

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8

机译：对应着色及其应用于列出着色平面图，没有长度为4到8的周期

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We introduce a new variant of graph coloring called correspondence colming which generalizes list coloring and allows for reductions previously only possible for ordinary coloring. Using this tool, we prove that excluding cycles of lengths 4 to 8 is sufficient to guarantee 3-choosability of a planar graph, thus answering a question of Borodin. (C) 2017 Elsevier Inc. All rights reserved.

著录项

来源
《Journal of Combinatorial Theory, Series B》 |2018年第2018期|共17页
作者
Dvorak Zdenek; Postle Luke;
展开▼
作者单位

Charles Univ Prague Prague Czech Republic;

Univ Waterloo Waterloo ON Canada;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类代数、数论、组合理论;
关键词
Correspondence coloring; DP-coloring; List coloring; Planar graphs;

机译：对应着色;DP着色;列表着色;平面图;

相似文献

外文文献
中文文献
专利

1. Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 [J] . Dvorak Zdenek, Postle Luke Journal of Combinatorial Theory, Series B . 2018,第期

机译：对应着色及其应用于列出着色平面图，没有长度为4到8的周期
2. DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6,7,8} [J] . Liu Runrun, Loeb Sarah, Rolek Martin, Graphs and combinatorics . 2019,第3期

机译：没有4，9周期的平面图的DP-3着色，来自{6,7,8}的两个长度的循环
3. Acyclic edge coloring of planar graphs without cycles of specific lengths [J] . Gao Y., Yu D. Journal of Applied Mathematics and Computing . 2011,第1a2期

机译：没有特定长度循环的平面图的非循环边缘着色
4. List-Coloring Graphs without Subdivisions and without Immersions [C] . Ken-ichi Kawarabayashi, Yusuke Kobayashi Annual ACM-SIAM Symposium on Discrete Algorithms . 2012

机译：列出着色图没有细分，而没有沉浸式
5. Degree-limited defective three colorings of planar graphs containing no 4-cycles or 5-cycles. [D] . Armstrong, Addie Eva Ruth. 2016

机译：不包含4个循环或5个循环的平面图的度受限缺陷三色。
6. The Impact of Catecholamines in Patients with or without Beta‐Blockers on the Ventricular Fibrillation Cycle Length and Ventricular Fibrillation Cycle Length Variability [O] . Bokyung Min, Jeffrey Kluger, James S. Kalus, 2005

机译：儿茶酚胺对有或无β受体阻滞剂的患者对心室纤颤周期长度和心室纤颤周期长度变异性的影响
7. Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 [O] . Dvorak, Zdenek, Postle, Luke 2016

机译：对应着色及其在列表着色平面上的应用图表没有长度为4到8的循环

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8

摘要

著录项

相似文献

相关主题

期刊订阅