国家自然科学基金(61070230)

作品数：9被引量：18H指数：2
导出分析报告
相关作者：张欣刘桂真吴建良于永滕聪更多>>
相关机构：山东大学山东经济学院兰州大学更多>>
相关期刊：《Frontiers of Mathematics in China》《计算机应用》《运筹学学报（中英文）》《Acta Mathematica Sinica,English Series》更多>>
相关主题：英文GRAPHSGRAPHGIRTH线性荫度更多>>
相关领域：理学自动化与计算机技术电子电信生物学更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-9
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
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 
Properties of Hamilton cycles of circuit graphs of matroids被引量：5
《Frontiers of Mathematics in China》2013年第4期801-809,共9页Hao FAN Guizhen LIU 
The authors would like to thank the referees for providing some very helpful suggestions for revising this paper. This work was supported by the National Natural Science Foundation of China （Grant No. 61070230）.
Let G be a circuit graph of a connected matroid. P. Li and G. Liu [Comput. Math. Appl., 2008, 55： 654-659] proved that G has a Hamilton cycle including e and another Hamilton cycle excluding e for any edge e of G if ...
关键词：MATROID circuit graph of matroid Hamilton cycle 
On Edge Colorings of 1-Toroidal Graphs被引量：2
《Acta Mathematica Sinica,English Series》2013年第7期1421-1428,共8页Xin ZHANG Gui Zhen LIU 
supported by National Natural Science Foundation of China (Grant No. 11026184);supported by National Natural Science Foundation of China (Grant No. 61070230);Research Fund for the Doctoral Program of Higher Education (Grant No. 20100131120017);the Fundamental Research Funds for the Central Universities
A graph is 1-toroidal, if it can be embedded in the torus so that each edge is crossed by at most one other edge. In this paper, it is proved that every 1-toroidal graph with maximum degree △ ≥ 10 is of class one in...
关键词：1-Toroidal graph 1-planar graph edge coloring 
Light Subgraphs in the Family of 1-Planar Graphs with High Minimum Degree被引量：2
《Acta Mathematica Sinica,English Series》2012年第6期1155-1168,共14页Xin ZHANG Gui Zhen LIU Jian Liang WU 
Supported by National Natural Science Foundation of China (Grant Nos. 10971121, 11026184, 61070230);Research Fund for the Doctoral Program of Higher Education (Grant No. 20100131120017);Graduate Independent Innovation Foundation of Shandong University (Grant No. yzc10040);the financial support from the Chinese Ministry of Education Prize for Academic Doctoral Fellows
A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. In this paper, it is shown that each 1-planar graph with minimum degree 7 contains a copy of K2 V （K1 ∪ K2...
关键词：1-Planar graph LIGHTNESS HEIGHT DISCHARGING 
New Upper Bounds on Linear Coloring of Planar Graphs被引量：1
《Acta Mathematica Sinica,English Series》2012年第6期1187-1196,共10页Bin LIU Gui Zhen LIU 
Supported by National Natural Science Foundation of China (Grant Nos. 61070230, 10971121 and 61103199);NSFSP of China (Grant No. ZR2009AM009)
A proper vertex coloring of a graph G is linear if the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number lc（G） of the graph G is the smallest n...
关键词：Linear coloring planar graph GIRTH 
关于可嵌入曲面图的列表(d,1)-全标号问题(英文)被引量：1
《运筹学学报》2011年第3期29-37,共9页于永 张欣 刘桂真 
Graduate Independent Innovation Foundation of Shandong University(yzc11025);National Natural Science Foundation of China(61070230,11026184,10901097);Research Fund for the Doctoral Program of Higher Education of China(200804220001,20100131120017); the Scientific Research Foundation for the Returned Overseas Chinese Scholars
图的(d,1)-全标号问题最初是由Havet等人提出的.在本文中,我们考虑了可嵌入曲面图的列表(d,1)-全标号问题,并证明了其列表(d,1)-全标号数不超过△(G)+2d.
关键词：(D 1)-全标号 列表(d 1)-全标号 列表(d 1)-全标号数 图 
1-平面图的线性荫度(英文)被引量：8
《运筹学学报》2011年第3期38-44,共7页张欣 刘桂真 吴建良 
National Natural Science Foundation of China(10971121,11101243,61070230);The Research Fund for the Doctoral Program of Higher Education(20100131120017); Graduate Independent Innovation Foundation of Shandong University(yzc10040)
证明了最大度△≥33的1-平面图的线性荫度为[△/2]
关键词：1-平面图 1-嵌入图 线性荫度 
完全图中的正常染色的路和圈(英文)
《运筹学学报》2011年第3期51-56,共6页王光辉 周珊 
National Natural Science Foundation of China(61070230,11026184,11101243);Independent Innovation Foundation of Shandong University(2009hw001);Research Fund for the Doctoral Program of Higher Education of China(20100131120017);the Scientific Research Foundation for the Returned Overseas Chinese Scholars
令K_n^c表示n个顶点的边染色完全图.令△^(mon)(K_n^c)表示K_n^c的顶点上关联的同种颜色的边的最大数目.如果K_n^c中的一个圈(路)上相邻的边染不同颜色,则称它为正常染色的.B.Bollobas和P.Erd(o|¨)s(1976)提出了如下猜想:若△^(mon)(K_...
关键词：正常染色圈 完全图 
切换到高一层路网最近四个点的最短路算法
《计算机应用》2010年第11期2880-2883,3001,共5页滕聪 
国家自然科学基金资助项目(61070230)
针对基于大规模图的最短路问题求解速度慢的问题,提出了一个基于路网等级的求最短路的快速近似算法。该算法首先求出高一层路网到起点的4个最近点和到终点的4个最近点及最短路径,由高一层路网形成的子图T再加上这8个最短路径形成图T′,...
关键词：最短路问题 DIJKSTRA算法 大规模计算 路网等级 时间复杂度 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部