scientific article
From MaRDI portal
Publication:3118386
zbMath1255.68071MaRDI QIDQ3118386
Publication date: 2 March 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enumeration in graph theory (05C30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other model constructions (03C30)
Related Items (3)
Perfect matchings, rank of connection tensors and graph homomorphisms ⋮ A dichotomy for bounded degree graph homomorphisms with nonnegative weights ⋮ A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights
This page was built for publication:
