当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
A complexity dichotomy for critical values of the b-chromatic number of graphs
Theoretical Computer Science ( IF 0.747 ) Pub Date : 2020-02-12 , DOI: 10.1016/j.tcs.2020.02.007
Lars Jaffke, Paloma T. Lima

A b-coloring of a graph G is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b-Coloring problem asks whether a graph G has a b-coloring with k colors. The b-chromatic number of a graph G, denoted by χb(G), is the maximum number k such that G admits a b-coloring with k colors. We consider the complexity of the b-Coloring problem, whenever the value of k is close to one of two upper bounds on χb(G): The maximum degree Δ(G) plus one, and the m-degree, denoted by m(G), which is defined as the maximum number i such that G has i vertices of degree at least i1. We obtain a dichotomy result for all fixed kN when k is close to one of the two above mentioned upper bounds. Concretely, we show that if k{Δ(G)+1p,m(G)p}, the problem is polynomial-time solvable whenever p{0,1} and, even when k=3, it is NP-complete whenever p2. We furthermore consider parameterizations of the b-Coloring problem that involve the maximum degree Δ(G) of the input graph G and give two FPT-algorithms. First, we show that deciding whether a graph G has a b-coloring with m(G) colors is FPT parameterized by Δ(G). Second, we show that b-Coloring is FPT parameterized by Δ(G)+k(G), where k(G) denotes the number of vertices of degree at least k.

更新日期:2020-02-12

 

全部期刊列表>>
物理学研究前沿热点精选期刊推荐
chemistry
《自然》编辑与您分享如何成为优质审稿人-信息流
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
自然职场线上招聘会
ACS ES&T Engineering
ACS ES&T Water
ACS Publications填问卷
屿渡论文,编辑服务
阿拉丁试剂right
南昌大学
王辉
南方科技大学
刘天飞
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
X-MOL
苏州大学
廖矿标
深圳湾
试剂库存
down
wechat
bug