Efficient algorithms for counting parameterized list \(H\)-colorings

DOI10.1016/j.jcss.2008.02.004zbMath1160.68024MaRDI QIDQ931733

Dimitrios M. Thilikos, Josep Diaz, Maria J. Serna

Publication date: 26 June 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2008.02.004

zbMATH Keywords

parameterization; counting problems; restrictive \(H\)-coloring; restrictive list \(H\)-coloring

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)