数学物理学报 ›› 2008, Vol. 28 ›› Issue (6): 1164-1172.

• 论文 • 上一篇    下一篇

重图的超f - 边覆盖染色

辛永训;刘桂真   

  1. (青岛农业大学理学院 青岛 266109)
  • 收稿日期:2006-03-30 修回日期:2007-11-25 出版日期:2008-12-25 发布日期:2008-12-25
  • 通讯作者: 辛永训
  • 基金资助:

    国家自然科学基金(10471078)和RSDP(20040422004)资助

On Super f- Edge Cover-Coloring of Multigraphs

Xin Yongxun;Liu Guizhen   

  1. (School of Sciences, Qingdao Agriculture University, Qingdao 266109)
  • Received:2006-03-30 Revised:2007-11-25 Online:2008-12-25 Published:2008-12-25
  • Contact: Xin Yongxun

摘要:

G的一个超f - 边覆盖染色就是它的一个f - 边覆盖染色并且使得图G中的重边染上不同的颜色. 令χHfc(G)是图G存在一个超f - 边覆盖染色时所需最大的颜色数k. χHfc(G)称作是图G的超f - 边覆盖染色色数. 本文讨论重图的超f - 边覆盖染色的存在性并且给出了重图的超f - 边覆盖染色的色数下界.

关键词: 重图, f -边覆盖染色, f -边覆盖染色, 交错链, 障碍

Abstract:

An edge cover-coloring of a graph G is called a super f-edge cover-coloring, if each color appears at each vertex v at least f(v) times and multiple edges
receive different colors. Let χHfc denote the maximum positive integer k for which by using k colors a super f-edge cover-coloring of G exists. The existence of χHfc is discussed and its lower bound is obtained.

Key words: Multigraph, f-edge cover-coloring, Super f-edge cover-coloring, Exchange chain, Obstruction

中图分类号: 

  • 05C70