Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
type: Item
instance of: scholarly article
title: Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
zbMATH Open document ID: 1409.05156
author: Eglantine Camby
published in: Graphs and Combinatorics
publication date: 2019-03-21T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05-04
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7040459
zbMATH Keywords: vertex cover
zbMATH Keywords: connected vertex cover
zbMATH Keywords: dominating set
zbMATH Keywords: connected dominating set
zbMATH Keywords: forbidden induced subgraph
zbMATH Keywords: extremal graph
Wikidata QID: Q123334753
describes a project that uses: GraphsInGraphs
MaRDI profile type: Publication
full work available at URL: s00373-018-1981-x
OpenAlex ID: W2619504389
cites work: Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set
cites work: The price of connectivity for feedback vertex set
cites work: The Price of Connectivity for Vertex Cover
cites work: A note on an induced subgraph characterization of domination perfect graphs
cites work: The price of connectivity for dominating set: upper bounds and complexity
cites work: Connected vertex covers in dense graphs
cites work: Q5315023
cites work: On Hadwiger's Number and the Stability Number
cites work: A note on the characterization of domination perfect graphs
cites work: The price of connectivity for cycle transversals
cites work: On graphs for which the connected domination number is at most the total domination number
cites work: Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
cites work: Perfect connected-dominant graphs
cites work: A characterization of domination perfect graphs
cites work: An induced subgraph characterization of domination perfect graphs
cites work: A semi-induced subgraph characterization of upper domination perfect graphs
DOI: 10.1007/S00373-018-1981-X
Recommended article: The price of connectivity for dominating set: upper bounds and complexity
Recommended article: Extension and its price for the Connected Vertex Cover problem
Recommended article: Extension and its price for the connected vertex cover problem
Recommended article: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
Recommended article: Complexity and Approximation Results for the Connected Vertex Cover Problem
Recommended article: Q5419953
Recommended article: The price of connectivity for feedback vertex set
Recommended article: Connected domination: vertex criticality and matchings
Recommended article: Q5005166
Recommended article: On the parameterized complexity of vertex cover and edge cover with connectivity constraints
description: scientific article; zbMATH DE number 7040459