Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable

Shen L.; Wang Y.

首页> 外文期刊>Discrete mathematics >Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable

【24h】

Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable

机译：最大度数为7且没有5个循环的平面图是8色的

获取原文

获取原文并翻译 | 示例

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

团队文献服务 >>

页面导航

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

摘要

It is proved that planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable.

机译：证明最大度为7且没有5个循环的平面图是8完全可着色的。

著录项

来源
《Discrete mathematics 》 |2010年第18期| 共8页
作者
Shen L.; Wang Y.;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类离散数学 ;
关键词
Cycle; Maximum degree; Planar graph; Total coloring;

机译：周期;最大度;平面图;总着色;

相似文献

外文文献
中文文献
专利

1. Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable [J] . Shen L., Wang Y. Discrete mathematics . 2010 ,第17a18期

机译：最大度数为7且没有5个循环的平面图是8色的
2. Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords [J] . Jian Chang, Hui-Juan Wang, Jian-Liang Wu, Theoretical computer science . 2013 ,第Null期

机译：平面图的最大着色度，最大度数为8，不包含两个和弦的5个循环
3. Total colorings of embedded graphs with maximum degree seven and without 3-cycles adjacent to 5-cycles [J] . Bing Wang, Jian-Liang Wu Ars Combinatoria: An Australian-Canadian Journal of Combinatorics . 2019 ,第期

机译：嵌入图的总彩色，最大七度，没有3周期的3周期
4. Total Colorings of Planar Graphs with Maximum Degree Seven and without 3-Cycles Adjacent to 5-Cycles [C] . Guangde Liu, Bing Wang, Jian-liang Wu Foundations of intelligent systems . 2011

机译：平面图的最大着色度，最大度数为7，且不带5圈的3圈
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. Ex vivo preliminary investigation of radiographic quantitative assessment of cranial tibial displacement at varying degrees of canine stifle flexion with or without an intact cranial cruciate ligament [O] . Katrina A. Castaneda, Caleb C. Hudson, Brian S. Beale 2018

机译：有或没有完整的颅骨十字韧带的不同程度的犬脚屈曲性颅骨移位的影像学定量评估的离体放射学初步研究
7. Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests [O] . Eun-Kyung Cho, Ilkyoo Choi, Boram Park 2021

机译：划分平面图，没有4周期和5个循环进入有界度森林
8. Approximation Algorithm for the Maximum Independent Set Problem in Cubic Planar Graphs [R] . Choukhmane, E., Franco, J. 1986

机译：三次平面图中最大独立集问题的逼近算法

Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable

摘要

著录项

相似文献

相关主题

期刊订阅