Clique-width III

DOI10.1145/3280824zbMath1458.05245OpenAlexW2900958825WikidataQ128936941 ScholiaQ128936941MaRDI QIDQ4629979

Meirav Zehavi, Fedor V. Fomin, Saket Saurabh, Petr A. Golovach, 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 cyclecoloringexponential time hypothesisfine-grained complexity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (11)

Structural parameterizations of clique coloring ⋮ Parameterized analysis and crossing minimization problems ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Coloring \((4K_1,C_4,C_6)\)-free graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width ⋮ On the complexity of finding large odd induced subgraphs and odd colorings ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ Optimal centrality computations within bounded clique-width graphs ⋮ Maximum matching in almost linear time on graphs of bounded clique-width

This page was built for publication: Clique-width III