期刊文献+

不含3,4-圈的平面图的均匀染色

Equitable Coloring of Planar Graphs without 3,4-cycles
在线阅读 下载PDF
导出
摘要 图的正常点染色称为均匀的,若每个色类所含的顶点数至多相差1.利用平面图的性质及换色法技巧。证明了若图G是Δ(G)≥6且不含3,4-圈的平面图,则对任意的m≥Δ(G),图G是均匀m-可染的. A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one.Using the properties of planar graphs and method of changing colors.If G is a planar graph with maximum degree (G)≥6 and without 3,4-cycles,then G is equitably m-colorable for any m≥(G).
作者 谭香
机构地区 山东财政学院
出处 《科学技术与工程》 2010年第27期6607-6609,6627,共4页 Science Technology and Engineering
关键词 平面图 均匀染色 planar graph equitable coloring cycle
  • 相关文献

参考文献7

  • 1Bondy J A,Murty.Graph theory with applications.New York.North-Holland,1976.
  • 2Hajnal A,Szemerédi E.Proof of conjecture of Erdós,Eds.Rényi,A.Sós V T,Combinatorial theory and its application.London.North-holland,1970:601-603.
  • 3Meyer M.Equitable coloring.Amer:Math Monthly,1973;80:920-922.
  • 4Chen B L,Lih K W,Wu P L.Equitable coloring and the maximum degree.Europen J Combin,1994;15:443-447.
  • 5Hap H P,Zhang Y.The equitableΔ-coloring conjecture holds for outerplanar graphs.Bull Inst Math Acad Sinca,1997;25:,143-149.
  • 6Zhang Y,Hap H P.Equitable colorings of planar grphs.J Combin-ath Combin Comput,1998;27:97-105.
  • 7Grotzsh H.Ein drefarbensatz fur dreikreisfreie netze auf der kugel.Wiss Z Martin-luther-Univ Hall-Wittenberg,Mat-Natur Reche,1959;8:109-120.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部