License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.6.6.26
URN: urn:nbn:de:0030-drops-67266
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6726/
Go back to Dagstuhl Reports

Ellis-Monaghan, Jo ; Goodall, Andrew ; Makowsky, Johann A. ; Moffatt, Iain
Weitere Beteiligte (Hrsg. etc.): Jo Ellis-Monaghan and Andrew Goodall and Johann A. Makowsky and Iain Moffatt

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

pdf-format:
dagrep_v006_i006_p026_s16241.pdf (2 MB)

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.

BibTeX - Entry

@Article{ellismonaghan_et_al:DR:2016:6726,
  author =	{Jo Ellis-Monaghan and Andrew Goodall and Johann A. Makowsky and Iain Moffatt},
  title =	{{Graph Polynomials: Towards a Comparative Theory (Dagstuhl Seminar 16241)}},
  pages =	{26--48},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{6},
  number =	{6},
  editor =	{Jo Ellis-Monaghan and Andrew Goodall and Johann A. Makowsky and Iain Moffatt},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6726},
  URN =		{urn:nbn:de:0030-drops-67266},
  doi =		{10.4230/DagRep.6.6.26},
  annote =	{Keywords: complexity, counting functions, graph colourings, graph homomorphisms, graph invariants, graph polynomials, matroid invariants, second order logic, }
}

Keywords: complexity, counting functions, graph colourings, graph homomorphisms, graph invariants, graph polynomials, matroid invariants, second order logic,
Freie Schlagwörter (englisch): topological graph theory
Collection: Dagstuhl Reports, Volume 6, Issue 6
Issue Date: 2016
Date of publication: 17.11.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI