> Details

Ellis-Monaghan, Jo [Author]; Goodall, Andrew [Author]; Makowsky, Johann A. [Author]; Moffatt, Iain [Author] ; Jo Ellis-Monaghan and Andrew Goodall and Johann A. Makowsky and Iain Moffatt [Contributor]

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

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; E-Article
  • Title: Graph Polynomials: Towards a Comparative Theory (Dagstuhl Seminar 16241)
  • Contributor: Ellis-Monaghan, Jo [Author]; Goodall, Andrew [Author]; Makowsky, Johann A. [Author]; Moffatt, Iain [Author]
  • Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
  • Language: English
  • DOI: https://doi.org/10.4230/DagRep.6.6.26
  • Keywords: graph colourings ; counting functions ; second order logic ; graph polynomials ; matroid invariants ; graph homomorphisms ; topological graph theory ; graph invariants ; complexity
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: 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.
  • Access State: Open Access