A Most General Edge Elimination Polynomial – Thickening of Edges

DOI10.3233/FI-2010-233zbMath1203.05072arXiv0801.1600OpenAlexW1664007804MaRDI QIDQ3561219

Christian Hoffmann

Publication date: 25 May 2010

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.1600

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

A Most General Edge Elimination Polynomial ⋮ Complexity and approximability of the cover polynomial ⋮ The enumeration of vertex induced subgraphs with respect to the number of components ⋮ Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions ⋮ An extension of the bivariate chromatic polynomial

This page was built for publication: A Most General Edge Elimination Polynomial – Thickening of Edges