Dichotomy Theorems for Homomorphism Polynomials of Graph Classes

From MaRDI portal



Abstract: In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph H and want to find all graphs, from some graph class, homomorphic to this H. These graphs will be encoded by a family of polynomials. We give dichotomies for the polynomials for cycles, cliques, trees, outerplanar graphs, planar graphs and graphs of bounded genus.












This page was built for publication: Dichotomy Theorems for Homomorphism Polynomials of Graph Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176591)