Let G be a simple graph of order n and size m. An edge covering of a graph is a set of edges
such that every vertex of the graph is incident to at least one edge of the set. In this paper we …

Graph polynomials are graph parameters invariant under graph isomorphisms which take
values in a polynomial ring with a fixed finite number of indeterminates. We study graph …

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 …

Abstract (EN) Graph polynomials are polynomials associated to graphs that encode the
number of subgraphs with given properties. We list different frameworks used to define …

Given a graph property $\mathcal {P} $, F. Harary introduced in 1985$\mathcal {P} $-
colorings, graph colorings where each colorclass induces a graph in $\mathcal {P} $. Let …

Averbouch, Godlin and Makowsky define the edge elimination polynomial of a graph by a
recurrence relation with respect to the deletion, contraction and extraction of an edge. It …