Two objects can be distinguished if they have different measurable properties. Thus,
distinguishability depends on the Physics of the objects. In considering graphs, we revisit the …

This paper introduces a trivariate graph polynomial that is a common generalization of the
domination polynomial, the Ising polynomial, the matching polynomial, and the cut …

This is a book about graph polynomials from the combinatorial viewpoint, which means that
we consider a graph polynomial as an ordinary generating function that counts subgraphs of …

We study the computational complexity of counting problems defined over graphs.
Complexity dichotomies are proved for various sets of problems, which classify the …

Graph polynomials which are definable in Monadic Second Order Logic (MSOL MSOL) on
the vocabulary of graphs are Fixed-Parameter Tractable (FPT FPT) with respect to clique …

Methods for computing graph polynomials have received considerable attention in the
literature. This chapter discusses a logic-based approach which guarantees efficient …

Diese Arbeit beschäftigt sich mit dem Ising-Polynom, einem Graphenpolynom, das von
einem physikalischen Modell abgeleitet ist. Es werden verschiedene Darstellungen des …