Exact and Parameterized Algorithms for (k, i)-Coloring
From MaRDI portal
Publication:2971658
DOI10.1007/978-3-319-53007-9_25zbMath1485.68304OpenAlexW2585997002MaRDI QIDQ2971658
Rian Neogi, Venkatesh Raman, Prafullkumar Tale, Diptapriyo Majumdar
Publication date: 7 April 2017
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_25
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Data reduction for graph coloring problems
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Exact exponential algorithms.
- The strong perfect graph theorem
- Generalized k-tuple colorings of cycles and other graphs
- n-tuple colorings and associated graphs
- Set colourings of graphs
- Parameterized complexity of vertex colouring
- NP-completeness of a family of graph-colouring problems
- Upper bounds for constant-weight codes
- A (<5)-Colour Theorem for Planar Graphs
- Parameterized Algorithms