Paper Info
Title
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes.
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.
Year
Venue
Field
2016
J. Graph Algorithms Appl.
Discrete mathematics,Combinatorics,Outerplanar graph,Line graph,Graph property,Forbidden graph characterization,Graph homomorphism,Cograph,Symmetric graph,Universal graph,Mathematics
DocType
Volume
Issue
Journal
20
1
Citations 
PageRank 
References 
0
0.34
11
Authors
1
Name
Order
Citations
PageRank
Christian Engels1103.95