位置：成果数据库 > 期刊 > 期刊详情页
Total coloring of planar graphs with maximum degree 8
  • ISSN号：0304-3975
  • 期刊名称：Theoretical Computer Science
  • 时间：2014.2.20
  • 页码：54-61
  • 相关项目：图的染色问题及其在网络中的应用
作者： Wang, Huijuan|Wu, Lidong|Wu, Jianliang|
同期刊论文项目
图的染色问题及其在网络中的应用
期刊论文 26
同项目期刊论文
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
The linear arboricity of planar graphs without adjacent 4-cycles
The information transmission in community networks
List total coloring of pseudo-outerplanar graphs
Group Edge Choosability of Planar Graphs without Adjacent Short Cycles
Total coloring of planar graphs without adjacent chordal 5-cycles
Light 3-cycles in 1-planar graphs with degree restrictions
Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
A note on the weight of triangle in 1-planar graphs with minimum degree 6
Minimum total coloring of planar graph
Minimum number of disjoint linear forests covering a planar graph
Total colorings of F-5-free planar graphs with maximum degree 8
A Note on List Edge and List Total Coloring of Planar Graphs without Adjacent Short Cycles
The Influence of Human Heterogeneity to Information Spreading
Total coloring of embedded graphs with maximum degree at least seven
On total colorings of 1-planar graphs
On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree
Total Coloring of Planar GraphsWithout Chordal Short Cycles
List edge and list total coloring of planar graphswith maximum degree 8
Total Coloring of Planar GraphsWithout Some Chordal 6-cycles
A note on the minimum number of choosabilityof planar graphs
On the linear arboricity of graphs embeddable in surfaces
Drawing Complete Multipartite Graphs on the Plane withRestrictions on Crossings
EQUITABLE VERTEX ARBORICITY OF PLANAR GRAPHS