1. Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
- Author
-
Ma��afiejska, Anna, Ma��afiejski, Micha��, Ocetkiewicz, Krzysztof M., and Pastuszak, Krzysztof
- Subjects
Mathematics of computing ��� Graph coloring ,coloring algorithm ,biregular graphs ,interval edge coloring - Abstract
An edge coloring of a graph G is called interval edge coloring if for each v ��� V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by ��'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (��,��)-biregular if each vertex in one part has degree �� and each vertex in the other part has degree ��. A graph G is called (��*,��*)-bipartite if G is a subgraph of an (��,��)-biregular graph and the maximum degree in one part is �� and the maximum degree in the other part is ��. In the paper we study the problem of interval edge colorings of (k*,2*)-bipartite graphs, for k ��� {3,4,5}, and of (5*,3*)-bipartite graphs. We prove that every (5*,2*)-bipartite graph admits an interval edge coloring using at most 6 colors, which can be found in O(n^{3/2}) time, and we prove that an interval edge 5-coloring of a (5*,2*)-bipartite graph can be found in O(n^{3/2}) time, if it exists. We show that every (4^*,2^*)-bipartite graph admits an interval edge 4-coloring, which can be found in O(n) time. The two following problems of interval edge coloring are known to be NP-complete: 6-coloring of (6,3)-biregular graphs (Asratian and Casselgren (2006)) and 5-coloring of (5*,5*)-bipartite graphs (Giaro (1997)). In the paper we prove NP-completeness of 5-coloring of (5*,3*)-bipartite graphs., LIPIcs, Vol. 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021), pages 26:1-26:12
- Published
- 2021
- Full Text
- View/download PDF