国家自然科学基金(11301410)

作品数：8被引量：9H指数：3
导出分析报告
相关作者：田京京更多>>
相关机构：西安电子科技大学陕西理工大学更多>>
相关期刊：《Acta Mathematicae Applicatae Sinica》《Journal of the Operations Research Society of China》《吉林大学学报（理学版）》《Acta Mathematica Sinica,English Series》更多>>
相关主题：平面图CROSSINGIC-EDGE更多>>
相关领域：理学更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-8
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Linear Arboricity of Outer-1-Planar Graphs被引量：1
《Journal of the Operations Research Society of China》2021年第1期181-193,共13页Xin Zhang Bi Li 
supported by the Fundamental Research Funds for the Central Universities(No.JB170706);the Natural Science Basic Research Plan in Shaanxi Province of China(No.2017JM1010);the National Natural Science Foundation of China(Nos.11871055 and 11301410);supported by the Natural Science Basic Research Plan in Shaanxi Province of China(No.2017JQ1031);the National Natural Science Foundation of China(Nos.11701440 and 11626181).
A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.Zhang et al.(Edge covering pseudo-outerplanar graphs with forests,Discrete Mat...
关键词：Outer-1-planar graph CROSSING Linear arboricity Polynomial-time algorithm 
限制度的IC平面图中轻弦4-圈的权和
《吉林大学学报（理学版）》2020年第5期1093-1099,共7页田京京 
国家自然科学基金(批准号:11301410,11461038);陕西理工大学博士启动基金(批准号:SLGQD-1806).
删去完全图k 4任意一条边所得的图称为弦4-圈.利用权转移方法讨论限制度的IC-平面图中轻弦4-圈的权和,证明每个最小度至少为5且最小边度至少为11的IC-平面图含有一个轻弦4-圈v 1v 2v 3v 4v 1,并证明具有该类限制度的IC-平面图中轻弦4-...
关键词：IC-平面图 权转移方法 权和 弦4-圈 
List Edge Coloring of Outer-1-planar Graphs
《Acta Mathematicae Applicatae Sinica》2020年第3期737-752,共16页Xin ZHANG 
supported by the National Natural Science Foundation of China (Nos. 11871055,11301410);the Youth Talent Support Plan of Xi’an Association for Science and Technology,China (2018-6)
A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.It is known that the list edge chromatic numberχ′l(G)of any outer-1-planar g...
关键词：outerplanar graph outer-1-planar graph crossing distance list edge coloring 
Linear Arboricity of NIC-Planar Graphs被引量：1
《Acta Mathematicae Applicatae Sinica》2019年第4期924-934,共11页Bei NIU Xin ZHANG 
Supported by the National Natural Science Foundation of China(Nos.11871055,11301410);the Natural Science Basic Research Plan in Shaanxi Province of China(No.2017JM1010);the Fundamental Research Funds for the Central Universities(Nos.JB170706)
A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. It is proved that every NIC-planar graph with...
关键词：NIC-planar GRAPH LINEAR ARBORICITY LIGHT EDGE 
Equitable Coloring of Three Classes of 1-planar Graphs被引量：3
《Acta Mathematicae Applicatae Sinica》2018年第2期362-372,共11页Xin ZHANG Hui-juan WANG Lan XU 
supported by the Natural Science Basic Research Plan in Shaanxi Province of China(No.2017JM1010);the Fundamental Research Funds for the Central Universities(No.JB170706);the Specialized Research Fund for the Doctoral Program of Higher Education(No.20130203120021);the National Natural Science Foundation of China(No.11301410);the National Natural Science Foundation of China(No.11501316);the Shandong Provincial Natural Science Foundation,China(No.ZR2014AQ001);the China Postdoctoral Science Foundation(No.2015M570569);supported by the Natural Science Foundation of Xinjiang Province of China(No.2015211A003)
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 or independent crossings, say NIC-planar graph or IC-planar graph...
关键词：1-planar graph equitable coloring independent crossing 
外1-平面图的均匀点荫度被引量：3
《计算机工程与应用》2018年第10期51-53,80,共4页刘维婵 张欣 
高等学校博士学科点专项科研基金新教师类项目(No.20130203120021);国家自然科学基金青年科学基金项目(No.11301410);陕西省自然科学基础研究计划面上基金项目(No.2017JM1010);中央高校基本科研业务费项目(No.JB170706)
图的均匀树k-染色是图的一个点k-染色,其任何两个色类的大小相差至多为1,并且每个色类的导出子图是一个森林。使得图G具有均匀树k-染色的最小整数k称为图G的均匀点荫度。证明了每个外1-平面图的均匀点荫度至多为3,继而对于外1-平面图证...
关键词：图论 外1-平面图 均匀染色 点荫度 
1-平面图及其子类的染色被引量：3
《运筹学学报》2017年第4期135-152,共18页张欣 刘维婵 
陕西省自然科学基础研究计划面上基金(No.2017JM1010);中央高校基本科研业务费(No.JB170706);国家自然科学基金青年科学基金(No.11301410);国家级大学生创新创业训练计划(No.201710701125)
如果图G可以嵌入在平面上,使得每条边最多被交叉1次,则称其为1-可平面图,该平面嵌入称为1-平面图.由于1-平面图G中的交叉点是图G的某两条边交叉产生的,故图G中的每个交叉点c都可以与图G中的四个顶点(即产生c的两条交叉边所关联的四个顶...
关键词：1-平面图 NIC-平面图 IC-平面图 外1-平面图 染色 
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>
检索报告 对象比较 聚类工具 使用帮助 返回顶部