期刊
DISCRETE MATHEMATICS
卷 345, 期 2, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.disc.2021.112690
关键词
One-sided interval edge coloring; Interval edge coloring; Bipartite graph; Edge coloring
类别
This note affirms the existence of a cubic polynomial for X-interval coloring and deduces improved upper bounds for bipartite graphs with small maximum degree. The authors provide a positive answer to the question posed by Casselgren and Toft (2016), demonstrating that the X-interval coloring can be achieved with a polynomial of degree three.
For a bipartite graph G with parts X and Y, an X-interval coloring is a proper edge coloring of G by integers such that the colors on the edges incident to any vertex in X form an interval. Denote by chi'(int) (G, X) the minimum k such that G has an X-interval coloring with k colors. Casselgren and Toft (2016) [12] asked whether there is a polynomial P(Delta) such that if G has maximum degree at most A, then chi'(int)(G, X) <= P(A). In this short note, we answer this question in the affirmative; in fact, we prove that a cubic polynomial suffices. We also deduce some improved upper bounds on chi'(int)(G, X) for bipartite graphs with small maximum degree. (C) 2021 The Author(s). Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据