DagRep.9.6.125.pdf
- Filesize: 3.54 MB
- 18 pages
Document
Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 9, Issue 6
Volume: Dagstuhl Reports, Volume 9
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2019-11-28
Cite AsGet BibTex
Maria Chudnovsky, Daniel Paulusma, and Oliver Schaudt. Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271). In Dagstuhl Reports, Volume 9, Issue 6, pp. 125-142, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/DagRep.9.6.125
https://doi.org/10.4230/DagRep.9.6.125
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.
Keywords
- (certifying / parameterized / polynomial-time) algorithms
- computational complexity
- graph colouring
- hereditary graph classes
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads