Polynomial graph invariants from homomorphism numbers

DOI10.1016/j.disc.2015.11.022zbMath1329.05156arXiv1308.3999OpenAlexW1718505034MaRDI QIDQ906477

Delia Garijo, Jaroslav Nešetřil, Andrew J. Goodall

Publication date: 21 January 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.3999

zbMATH Keywords

graph homomorphismgraph polynomialgraph sequence

Mathematics Subject Classification ID

Graph polynomials (05C31) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

In praise of homomorphisms ⋮ Strongly polynomial sequences as interpretations

Cites Work

• Sparsity. Graphs, structures, and algorithms
• The enumeration of vertex induced subgraphs with respect to the number of components
• Distinguishing graphs by their left and right homomorphism profiles
• From a zoo to a zoology: Towards a general theory of graph polynomials
• Chromatic invariants for finite graphs: Theme and polynomial variations
• Upper bounds to the clique width of graphs
• Tree-depth, subgraph coloring and homomorphism bounds
• When Trees Grow Low: Shrubs and Fast MSO1
• On Counting Generalized Colorings
• A Most General Edge Elimination Polynomial
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial graph invariants from homomorphism numbers