Contractors and connectors of graph algebras
From MaRDI portal
Publication:3605157
DOI10.1002/jgt.20343zbMath1189.05115arXivmath/0505162MaRDI QIDQ3605157
Publication date: 20 February 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0505162
graph homomorphism; Tutte polynomial; graph algebra; connector; contractor; contraction-deletion; homomorphism functions
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
05C76: Graph operations (line graphs, products, etc.)
Related Items
Perfect matchings, rank of connection tensors and graph homomorphisms, Graphon convergence of random cographs, Graph parameters from symplectic group invariants, The large deviation principle for the Erdős-Rényi random graph, Local WL invariance and hidden shades of regularity, Finitely forcible graphons, Edge cut splitting formulas for Tutte-Grothendieck invariants, Estimating and understanding exponential random graph models, On the number of \(B\)-flows of a graph, Unnamed Item, Contractors for flows, On recognizing graphs by numbers of homomorphisms
Cites Work