Clique-width III

DOI10.1145/3280824zbMath1458.05245MaRDI QIDQ4629979

Meirav Zehavi, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Daniel Lokshtanov

Publication date: 28 March 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3280824

zbMATH Keywords

Hamiltonian cycle; coloring; exponential time hypothesis; fine-grained complexity

Mathematics Subject Classification ID

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

05C15: Coloring of graphs and hypergraphs

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

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C45: Eulerian and Hamiltonian graphs

68Q27: Parameterized complexity, tractability and kernelization