Our recent works on coloring and domination of graphs

来源 :第五届全国组合数学与图论大会 | 被引量 : 0次 | 上传用户:sheng45724575
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  In this talk, we report our recent works on coloring and domination on graphs.In particular, we prove every graph has a semi coloring, which answers an open problem of Daniely and Linial (2012, JGT).We disprove a conjecture on group coloring and a conjecture on outer domination.
其他文献
会议
会议
会议
会议
会议
会议
会议
会议
会议
  The concept of rainbow connection of a graph was first introduced by Chartrand et al.in 2006.Let G be a nontrivial connected graph on which an edge-coloring
会议