Enumeration and maximum number of minimal connected vertex covers in graphs
type: Item
instance of: scholarly article
title: Enumeration and maximum number of minimal connected vertex covers in graphs
zbMATH Open document ID: 1373.05008
author: Petr A. Golovach
author: Pinar Heggernes
author: Dieter Kratsch
published in: European Journal of Combinatorics
publication date: 2017-11-14T00:00:00Z
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6806768
zbMATH Keywords: chordal graphs
zbMATH Keywords: distance-hereditary graphs
MaRDI profile type: Publication
full work available at URL: j.ejc.2017.07.015
OpenAlex ID: W2964087509
cites work: Distance-hereditary graphs
cites work: Maximal induced matchings in triangle-free graphs
cites work: Graph Classes: A Survey
cites work: Enumerating maximal independent sets with applications to graph colouring.
cites work: Minimal dominating sets in graph classes: combinatorial bounds and enumeration
cites work: Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
cites work: Deterministic Parameterized Connected Vertex Cover
cites work: Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
cites work: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
cites work: On the minimum feedback vertex set problem: Exact and enumeration algorithms
cites work: Algorithms and Computation
cites work: Exact algorithms for graph homomorphisms
cites work: Enumerating minimal subset feedback vertex sets
cites work: Exact exponential algorithms.
cites work: Finding Induced Subgraphs via Minimal Triangulations
cites work: Q4198056
cites work: Feedback Vertex Sets in Tournaments
cites work: Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
cites work: Subset feedback vertex sets in chordal graphs
cites work: Algorithmic graph theory and perfect graphs
cites work: The Number of Maximal Independent Sets in Triangle-Free Graphs
cites work: On generating all maximal independent sets
cites work: A note on the complexity of the chromatic number problem
cites work: On cliques in graphs
cites work: A New Algorithm for Generating All the Maximal Independent Sets
DOI: 10.1016/J.EJC.2017.07.015
description: scientific article; zbMATH DE number 6806768