Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
From MaRDI portal
Publication:2790150
DOI10.7155/jgaa.00382zbMath1331.05111OpenAlexW2295066773MaRDI QIDQ2790150
Publication date: 3 March 2016
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00382
Graph polynomials (05C31) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (4)
Some complete and intermediate polynomials in algebraic complexity theory ⋮ Monotone arithmetic complexity of graph homomorphism polynomials ⋮ Unnamed Item ⋮ Variants of the determinant polynomial and the \textsf{VP}-completeness
This page was built for publication: Dichotomy Theorems for Homomorphism Polynomials of Graph Classes