KMS Of Academy of mathematics and systems sciences, CAS
Acyclic coloring of graphs with some girth restriction | |
Cai, Jiansheng1; Feng, Binlu1; Yan, Guiying2![]() | |
2016-05-01 | |
Source Publication | JOURNAL OF COMBINATORIAL OPTIMIZATION
![]() |
ISSN | 1382-6905 |
Volume | 31Issue:4Pages:1399-1404 |
Abstract | A vertex coloring of a graph is called acyclic if it is a proper vertex coloring such that every cycle receives at least three colors. The acyclic chromatic number of is the least number of colors in an acyclic coloring of . We prove that acyclic chromatic number of any graph with maximum degree and with girth at least is at most 2 Delta. |
Keyword | Graph Girth Coloring Acyclic coloring Local lemma |
DOI | 10.1007/s10878-015-9829-2 |
Language | 英语 |
Funding Project | NSFSD[ZR2013AM001] ; NSFSD[ZR2013AL016] ; NSFC[11371355] |
WOS Research Area | Computer Science ; Mathematics |
WOS Subject | Computer Science, Interdisciplinary Applications ; Mathematics, Applied |
WOS ID | WOS:000373574300003 |
Publisher | SPRINGER |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/22442 |
Collection | 应用数学研究所 |
Affiliation | 1.Weifang Univ, Sch Math & Informat Sci, Weifang 261061, Shandong, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China |
Recommended Citation GB/T 7714 | Cai, Jiansheng,Feng, Binlu,Yan, Guiying. Acyclic coloring of graphs with some girth restriction[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2016,31(4):1399-1404. |
APA | Cai, Jiansheng,Feng, Binlu,&Yan, Guiying.(2016).Acyclic coloring of graphs with some girth restriction.JOURNAL OF COMBINATORIAL OPTIMIZATION,31(4),1399-1404. |
MLA | Cai, Jiansheng,et al."Acyclic coloring of graphs with some girth restriction".JOURNAL OF COMBINATORIAL OPTIMIZATION 31.4(2016):1399-1404. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment