Publication:4660723
From MaRDI portal
zbMath1059.05049MaRDI QIDQ4660723
Publication date: 4 April 2005
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
The Complexity of Counting Surjective Homomorphisms and Compactions, Bounded Tree-Width and CSP-Related Problems, Counting \(4 \times 4\) matrix partitions of graphs, Testing list \(H\)-homomorphisms, The complexity of generalized domino tilings, Colouring, constraint satisfaction, and complexity, How many \(F\)'s are there in \(G\)?, \(H\)-coloring degree-bounded (acyclic) digraphs, List homomorphisms of graphs with bounded degrees, Towards a dichotomy theorem for the counting constraint satisfaction problem, Efficient algorithms for counting parameterized list \(H\)-colorings, Extension problems with degree bounds, The restrictive \(H\)-coloring problem, Complexity issues on bounded restrictive \(H\)-coloring, Graph partitions with prescribed patterns