scientific article
From MaRDI portal
Publication:2816064
zbMath1412.05064MaRDI QIDQ2816064
Richard C. Brewster, Pavol Hell
Publication date: 1 July 2016
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065305801210?np=y
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
The complexity of signed graph and edge-coloured graph homomorphisms ⋮ Chromatic polynomials of 2-edge-coloured graphs ⋮ The complexity of tropical graph homomorphisms ⋮ Complexity of planar signed graph homomorphisms to cycles ⋮ The recognition of bound quivers using edge-coloured homomorphisms
This page was built for publication:
