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


Acyclic Choosability of Graphs with Bounded Degree
Authors:Wang  Juan  Miao  Lian Ying  Li  Jin Bo  Liu  Yun Long
Institution:1.School of Management, Qufu Normal University, Rizhao, 276826, P. R. China
;2.School of Mathematics, China University of Mining and Technology, Xuzhou, 221116, P. R. China
;3.College of Engineering, Qufu Normal University, Rizhao, 276826, P. R. China
;
Abstract:Acta Mathematica Sinica, English Series - An acyclic colouring of a graph G is a proper vertex colouring such that every cycle uses at least three colours. For a list assignment L = {L(v)~ v...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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