scientific article; zbMATH DE number 2151253
From MaRDI portal
Publication:4660723
zbMath1059.05049MaRDI QIDQ4660723
Publication date: 4 April 2005
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) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Complexity issues on bounded restrictive \(H\)-coloring ⋮ Counting \(4 \times 4\) matrix partitions of graphs ⋮ Testing list \(H\)-homomorphisms ⋮ List homomorphisms of graphs with bounded degrees ⋮ Towards a dichotomy theorem for the counting constraint satisfaction problem ⋮ The complexity of generalized domino tilings ⋮ How many \(F\)'s are there in \(G\)? ⋮ Colouring, constraint satisfaction, and complexity ⋮ Bounded Tree-Width and CSP-Related Problems ⋮ Efficient algorithms for counting parameterized list \(H\)-colorings ⋮ The restrictive \(H\)-coloring problem ⋮ Graph partitions with prescribed patterns ⋮ \(H\)-coloring degree-bounded (acyclic) digraphs ⋮ Extension problems with degree bounds ⋮ The Complexity of Counting Surjective Homomorphisms and Compactions
