Improved upper bound for the degenerate and star chromatic numbers of graphs
文献类型：期刊论文
| 作者 | Cai, Jiansheng1; Li, Xueliang2,3; Yan, Guiying4
|
| 刊名 | JOURNAL OF COMBINATORIAL OPTIMIZATION
 |
| 出版日期 | 2017-08-01 |
| 卷号 | 34期号:2页码:441-452 |
| 关键词 | Degenerate coloring Star coloring Chromatic number Entropy compression method Upper bound |
| ISSN号 | 1382-6905 |
| DOI | 10.1007/s10878-016-0076-y |
| 英文摘要 | Let be a graphLet G = G(V, E) be a graph. A proper coloring of G is a function f : V -> N such that f (x) not equal f (y) for every edge xy is an element of E. A proper coloring of a graph G such that for every k >= 1, the union of any k color classes induces a (k - 1)-degenerate subgraph is called a degenerate coloring; a proper coloring of a graph with no two-colored P-4 is called a star coloring. If a coloring is both degenerate and star, then we call it a degenerate star coloring of graph. The corresponding chromatic number is denoted as chi(sd) (G). In this paper, we employ entropy compression method to obtain a new upper bound chi(sd) (G) = <= inverted right perpendicular19/6 Delta(3/2) + 5 Delta inverted left perpendicular for general graph G.. A proper coloring of G is a function such that for every edge . A proper coloring of a graph G such that for every , the union of any k color classes induces a -degenerate subgraph is called a degenerate coloring; a proper coloring of a graph with no two-colored is called a star coloring. If a coloring is both degenerate and star, then we call it a degenerate star coloring of graph. The corresponding chromatic number is denoted as . In this paper, we employ entropy compression method to obtain a new upper bound for general graph G. |
| 资助项目 | NSFC[11571258] ; NSFC[11371355] ; SDNSF[ZR2013AM001] |
| WOS研究方向 | Computer Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000405826600010 |
| 出版者 | SPRINGER |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/26153]  |
| 专题 | 应用数学研究所 |
| 通讯作者 | Cai, Jiansheng |
| 作者单位 | 1.Weifang Univ, Sch Math & Informat Sci, Weifang 261061, Peoples R China 2.Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China 3.Nankai Univ, LPMC TJKLC, Tianjin 300071, Peoples R China 4.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China |
| 推荐引用方式 GB/T 7714 | Cai, Jiansheng,Li, Xueliang,Yan, Guiying. Improved upper bound for the degenerate and star chromatic numbers of graphs[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2017,34(2):441-452. |
| APA | Cai, Jiansheng,Li, Xueliang,&Yan, Guiying.(2017).Improved upper bound for the degenerate and star chromatic numbers of graphs.JOURNAL OF COMBINATORIAL OPTIMIZATION,34(2),441-452. |
| MLA | Cai, Jiansheng,et al."Improved upper bound for the degenerate and star chromatic numbers of graphs".JOURNAL OF COMBINATORIAL OPTIMIZATION 34.2(2017):441-452. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。