国家自然科学基金(11201440)

作品数：3被引量：10H指数：1
导出分析报告
相关期刊：《Science China Mathematics》《Acta Mathematica Sinica,English Series》更多>>
相关主题：INDEPENDENTCROSSINGSPLANEDRAWINGGROUP更多>>
相关领域：理学机械工程更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-3
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Drawing Complete Multipartite Graphs on the Plane with Restrictions on Crossings被引量：9
《Acta Mathematica Sinica,English Series》2014年第12期2045-2053,共9页Xin ZHANG 
Supported by National Natural Science Foundation of China(Grant Nos.11301410,11201440,11101243);the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2013JQ1002);the Specialized Research Fund for the Doctoral Program of Higher Education(Grant No.20130203120021);the Fundamental Research Funds for the Central Universities(Grant Nos.K5051370003,K5051370021)
A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. A plane graph with near independent crossings （say NIC-planar graph） is a 1-planar graph with the restriction...
关键词：1-Planar graph independent crossings crossing number 
Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
《Science China Mathematics》2014年第1期211-220,共10页WANG HuiJuan LIU Bin WU JianLiang WANG Bing 
supported by National Natural Science Foundation of China (Grant Nos. 11201440,11271006 and 11271341);Graduate Independent Innovation Foundation of Shandong University (Grant No. yzc12100)
Let G be a graph which can be embedded in a surface of nonnegative Euler characteristic.In this paper,it is proved that the total chromatic number of G is △(G)+1 if △(G)9,where △(G)is the maximum degree of G.
关键词：TOTAL coloring Euler characteristic surface 
Group Edge Choosability of Planar Graphs without Adjacent Short Cycles被引量：1
《Acta Mathematica Sinica,English Series》2013年第11期2079-2086,共8页Xin ZHANG Gui Zhen LIU 
Supported by the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2013JQ1002);the Fundamental Research Funds for the Central Universities(Grant No.K5051370003);National Natural Science Foundation of China(Grant Nos.11101243,11201440,11301410 and 61070230)
In this paper, we prove that 2-degenerate graphs and some planar graphs without adjacent short cycles are group （△ （G）＋1）-edge-choosable, and some planar graphs with large girth and maximum degree are group △（...
关键词：Group edge coloring list coloring planar graphs short cycles GIRTH 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部