> Details

Chudnovsky, Maria [Author]; Paulusma, Daniel [Author]; Schaudt, Oliver [Author] ; Maria Chudnovsky and Daniel Paulusma and Oliver Schaudt [Contributor]

Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271)

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 Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271)
  • Contributor: Chudnovsky, Maria [Author]; Paulusma, Daniel [Author]; Schaudt, Oliver [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
  • Language: English
  • DOI: https://doi.org/10.4230/DagRep.9.6.125
  • Keywords: (certifying / parameterized / polynomial-time) algorithms ; graph colouring ; computational complexity ; hereditary graph classes
  • 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 19271 "Graph Colouring: from Structure to Algorithm", which was held from 30 June to 5 July 2019. The report contains abstracts for presentations about recent structural and algorithmic developments for the Graph Colouring problem and variants of it. It also contains a collection of open problems on graph colouring which were posed during the seminar.
  • Access State: Open Access