Clique-width for graph classes closed under complementation
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 128638
- Type
- D - Journal article
- DOI
-
10.1137/18M1235016
- Title of journal
- SIAM Journal on Discrete Mathematics
- Article number
- -
- First page
- 1107
- Volume
- 34
- Issue
- 2
- ISSN
- 08954801
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2020
- URL
-
https://doi.org/10.1137/18M1235016
- 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
-
5
- Research group(s)
-
B - Algorithms and Complexity
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This is a cornerstone paper in a series on boundedness of clique-width (surveyed in "Clique-width for hereditary graph classes, LMS Lecture Note Series 456 (2019) 1-56" by Dabrowski, Johnson and Paulusma). Its most involved result (Theorem 4) was essential for the almost-complete dichotomy for Graph Colouring in "A. Blanche et al., Hereditary graph classes: when the complexities of colouring and clique cover coincide, Journal of Graph Theory 91 (2019) 267-289". The new "bounded" classes served as application for a result in "F.V. Fomin, P.A. Golovach, T.J.F. Strømme, D.M. Thilikos, Partial Complementation of Graphs, SWAT 2018, 21:1-21:13.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -