Clique-width and well-quasi ordering of triangle-free graph classes
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 125404
- Type
- D - Journal article
- DOI
-
10.1016/j.jcss.2019.09.001
- Title of journal
- Journal of Computer and System Sciences
- Article number
- -
- First page
- 64
- Volume
- 108
- Issue
- -
- ISSN
- 00220000
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2019
- URL
-
https://doi.org/10.1016/j.jcss.2019.09.001
- 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
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Boundedness of clique-width of some class of graphs has important algorithmic implications. This paper provides a significant and novel extension of a known technique due to Dabrowski, Dross and Paulusma, Colouring diamond-free graphs, Journal of Computer and System Sciences 89 (2017) 410-431. As a surprising consequence of this extension, the technique can now also be applied for proving well-quasi-orderability of hereditary graph classes (i.e., graph classes closed under vertex deletion). Well-quasi-orderability is another highly desirable but very different graph class property that also has algorithmic implications.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -