License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2019.14
URN: urn:nbn:de:0030-drops-109584
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10958/
Martin, Barnaby ;
Paulusma, Daniël ;
Smith, Siani
Colouring H-Free Graphs of Bounded Diameter
Abstract
The Colouring problem is to decide if the vertices of a graph can be coloured with at most k colours for an integer k, such that no two adjacent vertices are coloured alike. A graph G is H-free if G does not contain H as an induced subgraph. It is known that Colouring is NP-complete for H-free graphs if H contains a cycle or claw, even for fixed k >= 3. We examine to what extent the situation may change if in addition the input graph has bounded diameter.
BibTeX - Entry
@InProceedings{martin_et_al:LIPIcs:2019:10958,
author = {Barnaby Martin and Dani{\"e}l Paulusma and Siani Smith},
title = {{Colouring H-Free Graphs of Bounded Diameter}},
booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-117-7},
ISSN = {1868-8969},
year = {2019},
volume = {138},
editor = {Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10958},
URN = {urn:nbn:de:0030-drops-109584},
doi = {10.4230/LIPIcs.MFCS.2019.14},
annote = {Keywords: vertex colouring, H-free graph, diameter}
}
|
Keywords: |
|
vertex colouring, H-free graph, diameter |
|
Collection: |
|
44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) |
|
Issue Date: |
|
2019 |
|
Date of publication: |
|
20.08.2019 |
