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
This report documents the program and the outcomes of Dagstuhl Seminar 14461 "High- performance Grap...
AbstractThis paper gives a number of recent results concerning total colourings and suggests that re...
Colour refinement is a simple algorithm that partitions the vertices of a graph according their "ite...
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on pra...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
This report documents the program and the outcomes of Dagstuhl Seminar 14071 "Graph Modification Pro...
The presentation discusses certain types of graph coloring problems with their applications
This report documents the program and the outcomes of Dagstuhl Seminar 11191 ``Graph Drawing with Al...
This report documents the program and outcomes of Dagstuhl Seminar 18241 ``High-performance Graph Al...
This book provides an up-to-date and rapid introduction to an important and currently active topic i...
This report documents the program and the outcomes of Dagstuhl Seminar 22481 "Vertex Partitioning in...
This paper reviews the current state of the literature surrounding methods for the general graph col...
This report documents the program and the outcomes of Dagstuhl Seminar 14461 “High- per-formance Gra...
In this thesis we shall introduce two interesting topics from graph theory and begin to explore what...
Please note that this paper has been submitted for publication in a journal and is unavailable at th...
This report documents the program and the outcomes of Dagstuhl Seminar 14461 "High- performance Grap...
AbstractThis paper gives a number of recent results concerning total colourings and suggests that re...
Colour refinement is a simple algorithm that partitions the vertices of a graph according their "ite...
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on pra...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
This report documents the program and the outcomes of Dagstuhl Seminar 14071 "Graph Modification Pro...
The presentation discusses certain types of graph coloring problems with their applications
This report documents the program and the outcomes of Dagstuhl Seminar 11191 ``Graph Drawing with Al...
This report documents the program and outcomes of Dagstuhl Seminar 18241 ``High-performance Graph Al...
This book provides an up-to-date and rapid introduction to an important and currently active topic i...
This report documents the program and the outcomes of Dagstuhl Seminar 22481 "Vertex Partitioning in...
This paper reviews the current state of the literature surrounding methods for the general graph col...
This report documents the program and the outcomes of Dagstuhl Seminar 14461 “High- per-formance Gra...
In this thesis we shall introduce two interesting topics from graph theory and begin to explore what...
Please note that this paper has been submitted for publication in a journal and is unavailable at th...
This report documents the program and the outcomes of Dagstuhl Seminar 14461 "High- performance Grap...
AbstractThis paper gives a number of recent results concerning total colourings and suggests that re...
Colour refinement is a simple algorithm that partitions the vertices of a graph according their "ite...