位置：成果数据库 > 期刊 > 期刊详情页
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
  • ISSN号：0012-365X
  • 期刊名称：Discrete Mathematics
  • 时间：0
  • 页码：2025-2030
  • 相关项目：图的（t,k,d）-树染色问题的研究
作者： Wang, Bing|Wu, Jian-Liang|
同期刊论文项目
图的（t,k,d）-树染色问题的研究
期刊论文 62
同项目期刊论文
The linear arboricity of planar graphs with maximum degree at least 5
The structure of plane graphs with independent crossings and its applications to coloring problems
Vertex-distinguishing edge colorings of graphs with degree sum conditions
A note on the total coloring of planar graphs without adjacent 4-cycles
Total coloring of embedded graphs of maximum degree at least ten
不含3-圈的1-平面图的边染色
k-forested choosability of planar graphs and sparse graphs
A note on relaxed equitable coloring of graphs
Total coloring of planar graphs with maximum degree 7
On edge colorings of 1-planar graphs without adjacent triangles
New upper bounds on linear coloring of planar graphs
稀疏图的 ｋ-森林染色
1-平面图的线性荫度(英文)
On (p,1)-total labelling of 1-planar graphs
1-平面图的结构性质及其在无圈边染色上的应用
Vertex-disjoint triangles in K-1,K-t-free graphs with minimum degree at least t
k-forested coloring of planar graphs with large girth
The linear arboricity of planar graphs without 5-cycles and 6-cycles
树的 k-分支限制控制数的一个下界
Acyclic total colorings of planar graphs without l cycles
On equitable and equitable list colorings of series-parallel graphs
On edge colorings of 1-planar graphs
List total colorings of planar graphs without triangles at small distance
The linear arboricity of planar graphs with maximum degree at least five
The method of coloring in graphs and its Application
New upper bounds for the heights of some light subgraphs in 1-planar graphs with high minimum degree
List edge and list total coloring of 1-planar graphs
The linear arboricity of planar graphs without chordal short cycles
Light subgraphs in the family of 1-planar graphs with high minimum degree
Total colorings of planar graphs without intersecting 5-cycles
(1, lambda)-Embedded graphs and the acyclic edge choosibility
On r-acyclic edge colorings of planar graphs
Equitable coloring and equitable choosability of planar graphs without 6- and 7-cycles
Acyclic edge coloring of planar graphs without small cycles
较少短圈的平面图的全色数
稀疏图的k-森林染色
树的k-分支限制控制数的一个下界
1-平面图的线性荫度