Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

For a connected graph G, the Schultz and modified Schultz polynomials, introduced by I. Gutman: Some relations between distance-based polynomials of trees. Bulletin, Classe des Sciences Mathématiques ...

We derive a formula for the chromatic polynomial of a chordal or a triangulated graph in terms of its maximal cliques. As a corollary we obtain a way to write down an explicit formula for the ...