scientific article; zbMATH DE number 1996252
From MaRDI portal
Publication:4432211
zbMath1035.05089MaRDI QIDQ4432211
Publication date: 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Minimum cost homomorphism dichotomy for oriented cycles ⋮ Graph homomorphisms and nodal domains ⋮ Digraph matrix partitions and trigraph homomorphisms ⋮ A dichotomy for minimum cost graph homomorphisms ⋮ Matrix partitions of perfect graphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Bounded Tree-Width and CSP-Related Problems ⋮ Minimum cost homomorphisms to semicomplete multipartite digraphs ⋮ The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops ⋮ Minimum cost and list homomorphisms to semicomplete digraphs ⋮ Graph partitions with prescribed patterns ⋮ Minimum Cost Homomorphisms to Reflexive Digraphs ⋮ A combinatorial constraint satisfaction problem dichotomy classification conjecture ⋮ \(H\)-coloring dichotomy revisited