• 主题
高级搜索  >
历史搜索 清空历史
首页> 中文期刊> 《数学学报（英文版）》 >Neighbor Sum Distinguishing Total Coloring of Triangle Free IC-planar Graphs

Neighbor Sum Distinguishing Total Coloring of Triangle Free IC-planar Graphs

         
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A graph is IC-planar if it admits a drawing in the plane such that each edge is crossed at most once and two crossed edges share no common end-vertex.A proper total-k-coloring of G is called neighbor sum distinguishing if∑_c(u)≠∑_c(v)for each edge uv∈E(G),where∑_c(v)denote the sum of the color of a vertex v and the colors of edges incident with v.The least number k needed for such a total coloring of G,denoted byχ∑"is the neighbor sum distinguishing total chromatic number.Pilsniak and Wozniak conjecturedχ∑"(G)≤Δ(G)+3 for any simple graph with maximum degreeΔ(G).By using the famous Combinatorial Nullstellensatz,we prove that above conjecture holds for any triangle free IC-planar graph with△(G)≥7.Moreover,it holds for any triangle free planar graph withΔ(G)≥6.

著录项

相似文献

  • 中文文献
  • 外文文献
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号