A new lower bound for the on-line coloring of intervals with bandwidth
From MaRDI portal
Publication:1686078
DOI10.1016/j.tcs.2017.10.029zbMath1382.68096arXiv1702.03536OpenAlexW2592436388MaRDI QIDQ1686078
Publication date: 20 December 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.03536
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
This page was built for publication: A new lower bound for the on-line coloring of intervals with bandwidth