Counting Homomorphisms to Sparse Graphs
From MaRDI portal
Publication:2851494
DOI10.1016/j.endm.2009.07.065zbMath1273.05146OpenAlexW1972811990MaRDI QIDQ2851494
Patrice Ossona de Mendez, Jaroslav Nešetřil
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.065
Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Colouring graphs with bounded generalized colouring number
- On the order of countable graphs
- Optimal node ranking of tree in linear time
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- On nowhere dense graphs
- Tree-depth, subgraph coloring and homomorphism bounds
- Finite Model Theory on Tame Classes of Structures
- Homomorphism preservation theorems
- First order properties on nowhere dense structures
- Operations with structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
