Colouring Diamond-free Graphs
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 109976
- Type
- D - Journal article
- DOI
-
10.1016/j.jcss.2017.06.005
- Title of journal
- Journal of Computer and System Sciences
- Article number
- -
- First page
- 410
- Volume
- 89
- Issue
- -
- ISSN
- 00220000
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2017
- URL
-
https://doi.org/10.1016/j.jcss.2017.06.005
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
B - Algorithms and Complexity
- Citation count
- 13
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The algorithms in this paper are based on showing boundedness of clique-width for the graph classes considered. As such, the paper solved several open problems from "K.K. Dabrowski and D. Paulusma, Clique-width of graph classes defined by two forbidden induced subgraphs, Computer Journal 59 (2016) 650-666". To illustrate that bounding clique-width is an interesting research goal on its own: the main clique-width result of the REF-submission (whose conference version was published in the proceedings of SWAT 2016) was accidentally re-proven by some renowned graph class experts in "A. Brandstadt, S. Mahfud, R. Mosca, Bounded clique-width of (S_{1,2,2},triangle)-free graphs, arXiv:1608.01820".
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -