图K_(2,2,4)和K_(2,2,5)具有M(3)性质Graphs K_(2,2,4) and K_(2,2,5) Have the Property M(3)
赵永强;李红;
摘要(Abstract)：
令G为1个给定的图.假设对图G的每1个顶点v,存在1个k色列表L(v),使得G存在唯一L-染色,则称G为唯一列表可染图.M.Ghebleh和E.S.Mahmoodian几乎完全刻画了唯一3-列表可染完全多部图,仅剩9个图没有解决.图K2,2,4和K2,2,5为2个没有解决的图.通过证明得知图K2,2,4和K2,2,5具有M(3)性质.
关键词(KeyWords)： 列表染色;唯一k-列表可染图;M(3)性质
基金项目(Foundation):
作者(Authors): 赵永强;李红;
参考文献(References)：
- [1]V.G.Vizing.Vertexcoloringwith given colors(in Russian)[J].Diskret.Analiz.,1976,29:3-10.
- [2]P.Erd!s,A.L.Rubin and H.Taylor H.Choosability in graphs[J].In Proceedings of west coast conference on combinatorics,graphtheory,and computing,number 26 in Congr.Numer.,Arcata,CA,September 1979,2:125-157.
- [3]N.Alon.Restricted colorings ofgraphs[C].In:K.Walker.Surveys in Combinatorics,number 187 in London Math.Soc.LNS,1993.
- [4]D.R.Woodall.List colourings of graphs[C].In:J.W.P.Hirschfeld.Surveys in Combinatorics,London Math.Soc.Lecture Note Series288.Cambridge:Cambridge UniversityPress,2001.
- [5]M.Mahdian and E.S.Mahmoodian.Acharacterization ofuniquely2-list colorable graphs[J].Ars Combin.,1999,51:295-305.
- [6]M.Ghebleh and E.S.Mahmoodian.On uniquelylist colorable graphs[J].Ars Combin.,2001,59:307-318.
- [7]D.B.West.Introduction tograph theory[M].Prentice Hall,Upper Saddle River.NJ,1996.
- [8]Y.G.Ganjali.et al.Uniquely2-list colorable graphs[J].Discrete Appl.Math.,2002,119:217-225