On structural parameterizations of happy coloring, empire coloring and boxicity
From MaRDI portal
Publication:1641127
DOI10.1007/978-3-319-75172-6_20zbMath1454.68096OpenAlexW2790123248MaRDI QIDQ1641127
Jayesh Choudhari, I. Vinod Reddy
Publication date: 15 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-75172-6_20
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (4)
Complexity and approximability of the happy set problem ⋮ Parameterized algorithms for the happy set problem ⋮ Graph classes and approximability of the happy set problem ⋮ Lower bounds for the happy coloring problems
This page was built for publication: On structural parameterizations of happy coloring, empire coloring and boxicity
