Ö.Y. Diner
Contraction and Deletion Blockers for Perfect Graphs and H -free Graphs
Diner, Ö.Y.; Paulusma, D.; Picouleau, C.; Ries, B.
Abstract
We study the following problem: for given integers d, k and graph G, can we reduce some fixed graph parameter π of G by at least d via at most k graph operations from some fixed set S? As parameters we take the chromatic number χ, clique number ω and independence number α, and as operations we choose edge contraction ec and vertex deletion vd. We determine the complexity of this problem for S={ec}S={ec} and S={vd}S={vd} and π∈{χ,ω,α}π∈{χ,ω,α} for a number of subclasses of perfect graphs. We use these results to determine the complexity of the problem for S={ec}S={ec} and S={vd}S={vd} and π∈{χ,ω,α}π∈{χ,ω,α} restricted to H-free graphs.
Journal Article Type | Article |
---|---|
Acceptance Date | Jun 12, 2018 |
Online Publication Date | Jun 22, 2018 |
Publication Date | Oct 25, 2018 |
Deposit Date | Jun 26, 2018 |
Publicly Available Date | Jun 22, 2019 |
Journal | Theoretical Computer Science |
Print ISSN | 0304-3975 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 746 |
Pages | 49-72 |
DOI | https://doi.org/10.1016/j.tcs.2018.06.023 |
Public URL | https://durham-repository.worktribe.com/output/1328307 |
Files
Accepted Journal Article
(535 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright Statement
© 2018 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
Classifying Subset Feedback Vertex Set for H-free graphs
(2022)
Presentation / Conference Contribution
Few induced disjoint paths for H-free graphs
(2022)
Presentation / Conference Contribution
An algorithmic framework for locally constrained homomorphisms
(2022)
Presentation / Conference Contribution
The Complexity of L(p,q)-Edge-Labelling
(2022)
Presentation / Conference Contribution
Computing Balanced Solutions for Large International Kidney Exchange Schemes
(2022)
Presentation / Conference Contribution
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