论文信息 - On recognizing graphs by numbers of homomorphisms - 字舞流文

On recognizing graphs by numbers of homomorphisms

Zdenek Dvorak | Z. Dvořák

[1] Egon Wanke,et al. The Tree-Width of Clique-Width Bounded Graphs Without Kn, n , 2000, WG.

[2] L. Lovász. Operations with structures , 1967 .

[3] Hans L. Bodlaender,et al. A Tourist Guide through Treewidth , 1993, Acta Cybern..

[4] Irena Lasiecka,et al. Optimization problems for structural acoustic models with thermoelasticity and smart materials , 1995 .

[5] Peter J. Cameron,et al. 6-Transitive graphs , 1980, J. Comb. Theory, Ser. B.

[6] Neil Immerman,et al. An optimal lower bound on the number of variables for graph identification , 1992, Comb..

[7] Jaroslav Nesetril,et al. Linear time low tree-width partitions and algorithmic consequences , 2006, STOC '06.

[8] Peter Jonsson,et al. The complexity of counting homomorphisms seen from the other side , 2004, Theor. Comput. Sci..