Notes on complexity of packing coloring

DOI10.1016/j.ipl.2018.04.012zbMath1478.68247arXiv1712.08373MaRDI QIDQ1641149

Florian Pfender, Bernard Lidický, Min-Ki Kim, Tomáš Masařík

Publication date: 15 June 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.08373

zbMATH Keywords

graph algorithms; chordal graphs; interval graphs; parameterized complexity; packing coloring

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C62: Graph representations (geometric and intersection representations, etc.)

68Q27: Parameterized complexity, tractability and kernelization