K. K. Dabrowski
Classifying the Clique-Width of H-Free Bipartite Graphs
Dabrowski, K. K. ; Paulusma, D.
Authors
Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor
Contributors
Zhipeng Cai
Editor
Alexander Zelikovsky
Editor
Anu G. Bourgeois
Editor
Abstract
Let G be a bipartite graph, and let H be a bipartite graph with a fixed bipartition (B H ,W H ). We consider three different, natural ways of forbidding H as an induced subgraph in G. First, G is H-free if it does not contain H as an induced subgraph. Second, G is strongly H-free if G is H-free or else has no bipartition (B G ,W G ) with B H ⊆ B G and W H ⊆ W G . Third, G is weakly H-free if G is H-free or else has at least one bipartition (B G ,W G ) with TeX or TeX. Lozin and Volz characterized all bipartite graphs H for which the class of strongly H-free bipartite graphs has bounded clique-width. We extend their result by giving complete classifications for the other two variants of H-freeness.
Citation
Dabrowski, K. K., & Paulusma, D. (2014). Classifying the Clique-Width of H-Free Bipartite Graphs. In Z. Cai, A. Zelikovsky, & A. G. Bourgeois (Eds.), 20th International Conference, COCOON 2014, Atlanta, GA, USA, 4-6 August 2014 ; proceedings (489-500). https://doi.org/10.1007/978-3-319-08783-2_42
Conference Name | 20th International Conference, COCOON 2014 |
---|---|
Conference Location | Atlanta, GA, USA |
Publication Date | Jan 1, 2014 |
Deposit Date | Dec 20, 2014 |
Publicly Available Date | Mar 29, 2024 |
Pages | 489-500 |
Series Title | Lecture notes in computer science |
Series Number | 8591 |
Series ISSN | 0302-9743,1611-3349 |
Book Title | 20th International Conference, COCOON 2014, Atlanta, GA, USA, 4-6 August 2014 ; proceedings. |
ISBN | 9783319087825 |
DOI | https://doi.org/10.1007/978-3-319-08783-2_42 |
Public URL | https://durham-repository.worktribe.com/output/1153880 |
Files
Accepted Conference Proceeding
(306 Kb)
PDF
Copyright Statement
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-08783-2_42
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