中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A note on the cover degeneracy of graphs

文献类型:期刊论文

作者Zhang, L; Wu, BYDR
刊名JOURNAL OF GRAPH THEORY
出版日期2006-02-01
卷号51期号:2页码:170-173
关键词planar graph cover degeneracy chromatic number
ISSN号0364-9024
DOI10.1002/jgt.20129
英文摘要We give a 4-chromatic planar graph, which admits a vertex partition into three parts such that the union of every two of them induces a forest. This solves a problem posed by Bohme. Also, by constructing an infinite sequence of graphs, we show that the cover degeneracy can be arbitrarily less than the chromatic number. (c) 2005 Wiley Periodicals, Inc.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000234686600005
出版者JOHN WILEY & SONS INC
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/3923]  
专题中国科学院数学与系统科学研究院
通讯作者Zhang, L
作者单位1.Tongji Univ, Dept Appl Math, Shanghai 200092, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
3.Xinjiang Univ, Coll Math & Syst Sci, Xinjiang 830046, Peoples R China
推荐引用方式
GB/T 7714
Zhang, L,Wu, BYDR. A note on the cover degeneracy of graphs[J]. JOURNAL OF GRAPH THEORY,2006,51(2):170-173.
APA Zhang, L,&Wu, BYDR.(2006).A note on the cover degeneracy of graphs.JOURNAL OF GRAPH THEORY,51(2),170-173.
MLA Zhang, L,et al."A note on the cover degeneracy of graphs".JOURNAL OF GRAPH THEORY 51.2(2006):170-173.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。