Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
Computational Complexity
2014-12-02 v1
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 and want to find all graphs, from some graph class, homomorphic to this . 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.
Cite
@article{arxiv.1412.0423,
title = {Dichotomy Theorems for Homomorphism Polynomials of Graph Classes},
author = {Christian Engels},
journal= {arXiv preprint arXiv:1412.0423},
year = {2014}
}