7 search results - page 2 / 2 » Planar Subgraph Isomorphism Revisited |
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
DM
2011
12 years 11 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...