Bounding clique-width via perfect graphs
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 104310
- Type
- D - Journal article
- DOI
-
10.1016/j.jcss.2016.06.007
- Title of journal
- Journal of Computer and System Sciences
- Article number
- -
- First page
- 202
- Volume
- 104
- Issue
- -
- ISSN
- 00220000
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2016
- URL
-
https://doi.org/10.1016/j.jcss.2016.06.007
- 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
- 5
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This is a cornerstone paper of an on-going series on boundedness of clique-width for hereditary graph classes (see also the survey "K.K. Dabrowski, M. Johnson, D. Paulusma, Clique-width for hereditary graph classes, LMS Lecture Note Series 456 (2019) 1-56"). The results are used to prove almost-complete dichotomies for (1) Graph Isomorphism in "M. Bonamy, N. Bousquet, K.K. Dabrowski, M. Johnson, D. Paulusma, T. Pierron, Graph isomorphism for (H1,H2)-free graphs: an almost complete dichotomy, Algorithmica, forthcoming" (2) clique-width of atoms in "K.K. Dabrowski, T. Masarik, J. Novotna, D. Paulusma, P. Rzazewski, Clique-width: harnessing the power of atoms, Proc. WG 2020, forthcoming".
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -