scientific article; zbMATH DE number 1834657
From MaRDI portal
Publication:4779153
zbMath0999.68157MaRDI QIDQ4779153
Dimitrios M. Thilikos, Maria J. Serna, Josep Diaz
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360304
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 (6)
Compactors for parameterized counting problems ⋮ Parameterized algorithms for min-max multiway cut and list digraph homomorphism ⋮ Mixed hypergraphs and other coloring problems ⋮ Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. ⋮ Efficient algorithms for counting parameterized list \(H\)-colorings ⋮ The restrictive \(H\)-coloring problem
This page was built for publication:
