首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Neighbor distinguishing total choice number of sparse graphs via the Combinatorial Nullstellensatz
Authors:Qu  Cun-quan  Ding  Lai-hao  Wang  Guang-hui  Yan  Gui-ying
Institution:1.School of Mathematics, Shandong University, Jinan, 250100, China
;2.Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, China
;
Abstract:Acta Mathematicae Applicatae Sinica, English Series - Let G = (V,E) be a graph and ?: V ∪E → {1, 2, · · ·, k} be a total-k-coloring of G. Let f(v)(S(v)) denote the...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号