云南高校图书馆联盟文献共享服务平台- 国家自然科学基金(s10871119)

国家自然科学基金(s10871119): 作品数：2被引量：4H指数：1; 导出分析报告; 相关期刊：《Science China Mathematics》《Acta Mathematica Sinica,English Series》更多>>; 相关主题：GRAPHSEULERCHROMATICTOTALCOLORING更多>>; 相关领域：理学自动化与计算机技术更多>>

-

在结果中检索

检索结果分析

结果分析中...

共条记录，以下是1-2

全选清除导出

参考文献引证文献引用追踪

视图：

排序：

List Total Colorings of Planar Graphs without Triangles at Small Distance被引量：1: 《Acta Mathematica Sinica,English Series》2011年第12期2437-2444,共8页Bin LIU Jian Feng HOU Gui Zhen LIU; Suppose that G is a planar graph with maximum degree △. In this paper it is proved that G is total-（△ ＋ 2）-choosable if （1） △ ≥ 7 and G has no adjacent triangles （i.e., no two triangles are incident with a c...; 关键词：List total coloring CHOOSABILITY planar graph

Total coloring of embedded graphs of maximum degree at least ten被引量：3: 《Science China Mathematics》2010年第8期2127-2133,共7页HOU JianFeng 1,2,WU JianLiang 2,LIU GuiZhen 2 & LIU Bin 2 1 Center for Discrete Mathematics,Fuzhou University,Fuzhou 350002,China 2 School of Mathematics,Shandong University,Jinan 250100,China; supported by the Research Foundation for Doctor Programme (Grant No.200804220001);National Natural Science Foundation of China (Grant Nos.10871119,10971121,10901097); A total k-coloring of a graph G is a coloring of V(G) ∪ E(G) using k colors such that no two adjacent or incident elements receive the same color.The total chromatic number χ〃(G) is the smallest integer k such that...; 关键词：surface EULER characteristic TOTAL COLORING TOTAL CHROMATIC number

全选清除导出

共1页<1>

检索报告对象比较聚类工具使用帮助返回顶部