国家自然科学基金(ZR2009AM009)

作品数：1被引量：5H指数：1
导出分析报告
相关期刊：《Science China Mathematics》更多>>
相关主题：UTTRIANGLESAREHO更多>>
相关领域：理学更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-1
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable被引量：5
《Science China Mathematics》2012年第12期2601-2612,共12页CAI JianSheng WANG GuangHui YAN GuiYing 
supported by Natural Science Foundation of Shandong Province (Grant No. ZR2009AM009);Scientific Research Foundation for the Excellent Middle-Aged and Youth Scientists of Shandong Province (Grant No. BS2012SF016);National Natural Science Foundation of China (Grant Nos.11001055 and 11101243)
The minimum number of colors needed to properly color the vertices and edges of a graph G is called the total chromatic number of G and denoted by χ'' (G). It is shown that if a planar graph G has maximum degree Δ≥...
关键词：total coloring planar graph chordal 4-cycles TRIANGLES 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部