A. Brandstädt
Bounding the clique-width of H-free split graphs
Brandstädt, A.; Dabrowski, K.K.; Huang, S.; Paulusma, D.
Abstract
A graph is H-free if it has no induced subgraph isomorphic to H. We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We identify five new classes of H-free split graphs whose clique-width is bounded. Our main result, obtained by combining new and known results, provides a classification of all but two stubborn cases, that is, with two potential exceptions we determine all graphs H for which the class of H-free split graphs has bounded clique-width.
Citation
Brandstädt, A., Dabrowski, K., Huang, S., & Paulusma, D. (2015). Bounding the clique-width of H-free split graphs. . https://doi.org/10.1016/j.endm.2015.06.069
Conference Name | European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), |
---|---|
Conference Location | Bergen, Norway |
Publication Date | Nov 12, 2015 |
Deposit Date | Aug 12, 2015 |
Publicly Available Date | Mar 29, 2024 |
Volume | 49 |
Pages | 497-503 |
Series Title | Electronic Notes in Discrete Mathematics |
Series ISSN | 1571-0653 |
DOI | https://doi.org/10.1016/j.endm.2015.06.069 |
Keywords | Clique-width, Split graphs, Perfect graphs, Forbidden induced subgraph, Hereditary graph class. |
Public URL | https://durham-repository.worktribe.com/output/1152202 |
Additional Information | Conference dates: August 31 — September 4, 2015 |
Files
Accepted Conference Proceeding
(0)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright Statement
© 2015 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
You might also like
Solving Infinite-Domain CSPs Using the Patchwork Property
(2023)
Conference Proceeding
Disjunctive Temporal Problems under Structural Restrictions
(2021)
Conference Proceeding
Fine-Grained Complexity of Temporal Problems
(2020)
Conference Proceeding
Independent transversals versus transversals
(2019)
Conference Proceeding
Filling the complexity gaps for colouring planar and bounded degree graphs
(2019)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search