最大度大于等于7的平面图的线性荫度

图的染色问题在组合优化、计算机科学和Hessians矩阵的网络计算等方面具有非常重要的应用。其中图的染色中有一种重要的染色——线性荫度,它是一种非正常的边染色,即在简单无向图中,它的边可以分割成线性森林的最小数量。研究最大度△(G)≥7的平面图G的线性荫度,证明了对于两个固定的整数i,j∈{5,6,7},如果图G中不存在相邻的含弦i,j-圈,则图G的线性荫度为[△/2]。     

IC-平面图的线性荫度

图G的边分解是指将G分解成子图G₁,G₂,...,G_m,使得E(G)-E(G₁)∪…∪.E(G_m),且对任意i≠j,有E(G_i)∩E(G_j)=?.若一个森林的每个连通分支都是路,则称该森林为线性森林.图G的线性荫度la(G)是指使得G可以边分解为m个线性森林的最小整数m.本文证明了Δ(G)≥15的IC-平面图G的线性荫度为[Δ(G)/2],这里Δ(G)是图G的最大度.     

1-平面图的线性荫度

图G的边分解是指将G分解成子图G₁,G₂,…,G_m,使得E(G)=E(G₁)∪…∪E(G_m),且对任意i≠j有E(G_i)∩E(G_j)=?.若一个森林的每个连通分支都是路,则称该森林为线性森林.图G的线性荫度la(G)是指使得G可以边分解为m个线性森林的最小整数m.本文利用权转移方法证明了Δ(G)≥25的1-平面图G的线性荫度为[Δ(G)/2],这里Δ(G)是图G的最大度.     

6-圈至多含一弦平面图的线性荫度

线性森林是指每个连通分支都是路的图.图G的线性荫度la(G)等于将其边分解为k个边不交的线性森林的最小整数k.文中利用权转移方法证明了,若G是一个最大度大于等于7且每个6-圈至多含一条弦的平面图,则la(G)=「(△(G))/2」.     

1-平面图的线性荫度

证明了最大度$\Delta\geq 33$的1-平面图的线性荫度为$\lceil\Delta/2\rceil$     

不含5-圈和相邻4-圈的平面图的线性2-荫度的一个上界

图G的一个边分解是指将G分解成子图G_1,G_2,…,G_m使得E(G)=E(G_1)=∪E(G_2)∪…∪E(G_m),且对于i≠j,E(G_i)∩E(G_j)=?.一个线性k-森林是指每个分支都是长度最多为k的路的图.图G的线性k-荫度la_k(G)是使得G可以边分解为m个线性k-森林的最小整数m.显然,la_1(G)是G的边色数χ'(G); la_∞(G)表示每条分支路是无限长度时的情况,即通常所说的G的线性荫度la(G).利用权转移的方法研究平面图的线性2-荫度la_2(G).设G是不含有5-圈和相邻4-圈的平面图,证明了若G连通且δ(G)≥2,则G包含一条边xy使得d(x)+d(y)≤8或包含一个2-交错圈.根据这一结果得到其线性2-荫度的上界为[△/2]+4.     

最大度至少为8的可平面图的全染色

证明了最大度至少为8且不含带弦5圈或带弦6圈的可平面图是9全可染的.     

直径为2的可平面图的列表点荫度

图G的点荫度a(G)是用来染G的顶点集合的最少颜色数使得不产生单色圈.列表点荫度al(G)是这个概念在列表染色意义下的推广.本文证明了:若G是一个直径为2的可平面图,则al(G)≤2.     

平面图线性色数的一个上界

如果图G的一个正常染色满足染任意两种颜色的顶点集合导出的子图是一些点不交的路的并,则称这个正常染色为图G的线性染色．图G的线性色数用lc（G）表示,是指G的所有线性染色中所用的最少颜色的个数．证明了：若G是一个最大度△（G）≠5,6的平面图,则lc（G）≤2△（G）．     

围长不小于6且最大度至少为8的平面图的无圈列表边染色

对图G的一个正常边染色,如果图G的任何一个圈至少染三种颜色,则称这个染色为无圈边染色.若L为图G的一个边列表,对图G的一个无圈边染色φ,如果对任意e∈E(G)都有ф(e)∈L(e),则称ф为无圈L-边染色.用a′_(list)(G)表示图G的无圈列表边色数.证明若图G是一个平面图,且它的最大度△≥8,围长g(G)≥6,则a′_(list)(G)=△.     

The linear arboricity of planar graphs of maximum degree seven is four

The linear arboricity of a graph G is the minimum number of linear forests which partition the edges of G. Akiyama et al. conjectured that for any simple graph G. Wu wu proved the conjecture for a planar graph G of maximum degree . It is noted here that the conjecture is also true for . © 2008 Wiley Periodicals, Inc. J Graph Theory 58:210‐220, 2008     

Total colorings of planar graphs with maximum degree at least 8

Planar graphs with maximum degree Δ ⩾ 8 and without 5- or 6-cycles with chords are proved to be (δ + 1)-totally-colorable. This work was supported by Natural Science Foundation of Ministry of Education of Zhejiang Province, China (Grant No. 20070441)     

On the linear arboricity of planar graphs

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo, and Harary conjectured that for any simple graph G with maximum degree Δ. The conjecture has been proved to be true for graphs having Δ = 1, 2, 3, 4, 5, 6, 8, 10. Combining these results, we prove in the article that the conjecture is true for planar graphs having Δ(G) ≠ 7. Several related results assuming some conditions on the girth are obtained as well. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 129–134, 1999     

Total chromatic number of planar graphs with maximum degree ten

In this article we prove that the total chromatic number of a planar graph with maximum degree 10 is 11. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 91–102, 2007     

Flexibility of planar graphs of girth at least six

Let $G$ be a planar graph with a list assignment $L$. Suppose a preferred color is given for some of the vertices. We prove that if $G$ has girth at least six and all lists have size at least three, then there exists an $L$-coloring respecting at least a constant fraction of the preferences.     

Total colorings of planar graphs with large maximum degree

It is proved that a planar graph with maximum degree Δ ≥ 11 has total (vertex-edge) chromatic number $Delta; + 1. © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 53–59, 1997     

On total 9‐coloring planar graphs of maximum degree seven

Given a graph G, a total k‐coloring of G is a simultaneous coloring of the vertices and edges of G with at most k colors. If Δ(G) is the maximum degree of G, then no graph has a total Δ‐coloring, but Vizing conjectured that every graph has a total (Δ + 2)‐coloring. This Total Coloring Conjecture remains open even for planar graphs. This article proves one of the two remaining planar cases, showing that every planar (and projective) graph with Δ ≤ 7 has a total 9‐coloring by means of the discharging method. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 67–73, 1999     

On certain Hamiltonian cycles in planar graphs

The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that must be present in a 5-connected graph that is embedded into the plane or into the projective plane with face-width at least five. Especially, we show that every 5-connected plane or projective plane triangulation on n vertices with no non-contractible cyles of length less than five contains at least distinct Hamiltonian cycles. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 81–96, 1999