On the tractability of \((k,i)\)-coloring
From MaRDI portal
Publication:2636563
DOI10.1007/978-3-319-74180-2_16zbMath1497.68383arXiv1802.03634OpenAlexW4256338106MaRDI QIDQ2636563
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Saurabh Joshi
Publication date: 5 June 2018
Full work available at URL: https://arxiv.org/abs/1802.03634
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) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
This page was built for publication: On the tractability of \((k,i)\)-coloring
