欢迎您!
东篱公司
退出
申报数据库
申报指南
立项数据库
成果数据库
期刊论文
会议论文
著 作
专 利
项目获奖数据库
位置:
成果数据库
>
期刊
> 期刊详情页
A Planar linear arboricity conjecture
ISSN号:0364-9024
期刊名称:Journal of Graph Theory
时间:2012.4.4
页码:403-425
相关项目:几类图染色问题的研究
作者:
Cygan, Marek|Hou, Jian-Feng|Kowalik, Lukasz|Luzar, Borut|Wu, Jian-Liang|
同期刊论文项目
几类图染色问题的研究
期刊论文 19
同项目期刊论文
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
A Bound on the Bondage Number of Toroidal Graphs
Bondage Number of Planar Graphs without Small Cycles
Acyclic edge coloring of graphs with large girths
Acyclic chromatic index of planar graphs with triangles
Improved bounds for acyclic chromatic index of planar graphs
A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
An improved bound on acyclic chromatic index of planar graphs
Acyclic edge coloring of planar graphs with girth at least 5
Every Toroidal Graph Is Acyclically 8-Choosable
Total coloring of planar graphs without 6-cycles
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorabl
大围长图的广义无圈染色
最大度为8不含特定子图的平面图的全染色
Some results on (g,f)-uniform graphs
基于排队论的银行业务窗口设置优化
不含三角形的轮胎图的无圈边染色