• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Contraction and deletion blockers for perfect graphs and H-free graphs

Thumbnail
View/Open
Contraction_and.pdf (522.7Kb)
Date
2018
Dewey
Principes généraux des mathématiques
Sujet
Contraction blockers; Deletion blockers; Complexity; Perfect graphs; H-free graphs
Journal issue
Theoretical Computer Science
Volume
746
Publication date
10-2018
Article pages
49-72
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.tcs.2018.06.023
URI
https://basepub.dauphine.fr/handle/123456789/20768
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Diner, Öznur Yaşar
Paulusma, Daniël
Picouleau, Christophe
Ries, Bernard
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Type
Article accepté pour publication ou publié
Abstract (EN)
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} and 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} and S = {vd} and π ∈ {χ, ω, α} restricted to H-free graphs.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.