Document Open Access Logo

Graph Polynomials: Towards a Comparative Theory (Dagstuhl Seminar 16241)

Authors Jo Ellis-Monaghan, Andrew Goodall, Johann A. Makowsky, Iain Moffatt and all authors of the abstracts in this report

PDF

File

Thumbnail PDF
PDF
DagRep.6.6.26.pdf
  • Filesize: 2.29 MB
  • 23 pages

Document Identifiers

Subject Classification

Keywords
  • complexity
  • counting functions
  • graph colourings
  • graph homomorphisms
  • graph invariants
  • graph polynomials
  • matroid invariants
  • second order logic
  • topological graph theory

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 16241 "Graph Polynomials: Towards a Comparative Theory". 

The area of graph polynomials has become in recent years incredibly active, 
with new applications and new graph polynomials being discovered each year. 
However, the resulting plethora of techniques and results now urgently requires synthesis. Beyond catalogues and classifications we need a comparative theory.
The intent of this 5-day Seminar was to further a general theory of graph polynomials.

Cite As Get BibTex

Jo Ellis-Monaghan, Andrew Goodall, Johann A. Makowsky, and Iain Moffatt. Graph Polynomials: Towards a Comparative Theory (Dagstuhl Seminar 16241). In Dagstuhl Reports, Volume 6, Issue 6, pp. 26-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016) https://doi.org/10.4230/DagRep.6.6.26

Author Details

Jo Ellis-Monaghan
Andrew Goodall
Johann A. Makowsky
Iain Moffatt
and all authors of the abstracts in this report
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact