License
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.9.6.125
URN: urn:nbn:de:0030-drops-114905
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11490/
Go back to Dagstuhl Reports


Chudnovsky, Maria ; Paulusma, Daniel ; Schaudt, Oliver
Weitere Beteiligte (Hrsg. etc.): Maria Chudnovsky and Daniel Paulusma and Oliver Schaudt

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

pdf-format:
dagrep_v009_i006_p125_19271.pdf (4 MB)


Abstract

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.

BibTeX - Entry

@Article{chudnovsky_et_al:DR:2019:11490,
  author =	{Maria Chudnovsky and Daniel Paulusma and Oliver Schaudt},
  title =	{{Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271)}},
  pages =	{125--142},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{9},
  number =	{6},
  editor =	{Maria Chudnovsky and Daniel Paulusma and Oliver Schaudt},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11490},
  URN =		{urn:nbn:de:0030-drops-114905},
  doi =		{10.4230/DagRep.9.6.125},
  annote =	{Keywords: (certifying / parameterized / polynomial-time) algorithms, computational complexity, graph colouring, hereditary graph classes}
}

Keywords: (certifying / parameterized / polynomial-time) algorithms, computational complexity, graph colouring, hereditary graph classes
Seminar: Dagstuhl Reports, Volume 9, Issue 6
Issue Date: 2019
Date of publication: 28.11.2019


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