scientific article; zbMATH DE number 6850327
From MaRDI portal
Publication:4607896
zbMath1403.68164MaRDI QIDQ4607896
Petr A. Golovach, Saket Saurabh, Daniel Lokshtanov, Meirav Zehavi
Publication date: 15 March 2018
Full work available at URL: http://dl.acm.org/citation.cfm?id=3175285
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) 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)
Related Items (9)
Acyclic coloring parameterized by directed clique-width ⋮ Integer programming in parameterized complexity: five miniatures ⋮ A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) ⋮ Unnamed Item ⋮ The parameterized complexity of guarding almost convex polygons ⋮ Finer Tight Bounds for Coloring on Clique-Width ⋮ Computing the Chromatic Number Using Graph Decompositions via Matrix Rank ⋮ Comparing linear width parameters for directed graphs ⋮ Computing the chromatic number using graph decompositions via matrix rank
This page was built for publication:
