位置：成果数据库 > 期刊 > 期刊详情页
不含3-圈的1-平面图的边染色
  • 期刊名称：山东大学学报(理学版)
  • 时间：0
  • 页码：15-17
  • 分类：O157.5[理学—数学;理学—基础数学]
  • 作者机构：[1]山东大学数学学院,山东济南250100
  • 相关基金：国家自然科学基金资助项目（10871119, 10971121）
  • 相关项目：图的（t,k,d）-树染色问题的研究
作者： 张欣|刘桂真|吴建良|
关键词： 1-平面图, 三角形, 边色数, 1-planar graph, triangle, edge chromatic number
中文摘要：

利用权转移方法证明了最大度Δ≥7且不含3-圈的1-平面图是Δ-边可染的。

英文摘要：

It is shown that each triangle-free 1-planar graph with maximum degree ≥7 can be-colorable by the Discharging Method.

同期刊论文项目
图的（t,k,d）-树染色问题的研究
期刊论文 62
图上有限制条件的染色问题研究
期刊论文 25 会议论文 5
同项目期刊论文
Equitable edge-colorings of simple graphs
Acyclic edge chromatic number of outer planar graphs
The existence of even regular factors of regular graphs on the number of cut edges
The method of coloring in graphs and its Application
Vertex-distinguishing edge colourings of graphs with degree sum conditions
A new sufficient condition for graphs of f-class 1
On the fractional f-chromatic index of a graph
Acyclic edge coloring of planar graphs with large girth
Acyclic edge chromatic number of outerplanar graphs
Total colorings and list total colorings of planar graphs without interesting 4-cycles
Paths，cycles and colorings in digraphs
A cyclic edge colorings of planar graphs and series-paralle graphs
Edge coloring of embedded graphs without 4-cycles or chordal-4-cycles
On edge covering colorings of graphs
Vertex-distingushing edge colorings of graphs with degree sum conditions
一个能量有效的无线传感器网络局部式覆盖算法
（a,b,k）-临界图的一个充分条件
图的孤立韧度与分数（g，f）-因子的存在性
（a，b，Ck）-临界图
图有哈密顿（g,f）-因子的度条件
An energy-driven unequal clustering protocol for heterogeneous wireless sensor networks
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
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
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
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-平面图的线性荫度