围长至少为5的平面图的线性染色Linear Coloring of Plane Graphs with Girth at Least Five
王侃,崔淑玉,李超
摘要(Abstract)：
如果图G的一个正常染色满足任意两种颜色的顶点集合导出的子图是一些点不交的路的并,则称这个正常染色为图G的线性染色.图G的线性色数用lc(G)表示,是指G的所有线性染色中所用的最少颜色的个数.证明了对于每一个最大度为△围长至少为5的平面图G,lc(G)≤△+2.
关键词(KeyWords)： 平面图;线性染色;围长;最大度
基金项目(Foundation):
作者(Author): 王侃,崔淑玉,李超
DOI: 10.16393/j.cnki.37-1436/z.2010.02.005
参考文献(References)：
- [1]Yuster R.Linear coloring of graphs[J].Discrete Math,1998,185(1～3):293-297.
- [2]Grünbaum B.Acyclic colorings of planar graphs[J].Israel J Math,1973,14(4):390-408.
- [3]Borodin O V.On acyclic colorings of planar graphs[J].Discrete Math,1979,25(3):211-236.
- [4]Borodin O V,Fon-Der Flaass D G,Kostochka A V,et al.Acyclic list 7-coloring of planar graphs[J].J.Graph Theory,2002,40(2):83-90.
- [5]Kostochka A V.Acyclic 6-coloring of planar graphs[J].Metody Diskret Anal,1976,28:40-56.
- [6]Mitchem J.Every planar graph has an acyclic 8-coloring[J].Duke Math J,1974,41(1):177-181.
- [7]Esperet L,Montassier M,Raspaud A.Linear choosability of graphs[J].Discrete Math,2008,308(17):3938-3950.
- [8]Raspaud A,Wang W F.Linear coloring of planar graphs with large girth[J].Discrete Math,2009,309(18):5678-5686.