Enumeration and maximum number of minimal connected vertex covers in graphs
DOI10.1016/J.EJC.2017.07.015zbMATH Open1373.05008OpenAlexW2964087509MaRDI QIDQ1678095FDOQ1678095
Authors: Petr A. Golovach, Pinar Heggernes, Dieter Kratsch 
Publication date: 14 November 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2017.07.015
Recommendations
- Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
- Complexity and Approximation Results for the Connected Vertex Cover Problem
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
- Enumeration of minimal connected dominating sets for chordal graphs
- Enumerating minimal connected dominating sets in graphs of bounded chordality
Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Exact exponential algorithms.
- Algorithmic graph theory and perfect graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- On cliques in graphs
- Algorithms and Computation
- Distance-hereditary graphs
- Subset feedback vertex sets in chordal graphs
- Exact algorithms for graph homomorphisms
- Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Enumerating minimal subset feedback vertex sets
- Feedback vertex sets in tournaments
- Enumerating maximal independent sets with applications to graph colouring.
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- On generating all maximal independent sets
- Finding induced subgraphs via minimal triangulations
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
- The Number of Maximal Independent Sets in Triangle-Free Graphs
- A note on the complexity of the chromatic number problem
- Deterministic parameterized connected vertex cover
Cited In (12)
- Enumeration of connected graph coverings
- Extension and its price for the connected vertex cover problem
- Maximal and maximum dissociation sets in general and triangle-free graphs
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- Minimum number of maximal dissociation sets in trees
- Enumeration of minimal connected dominating sets for chordal graphs
- On the maximum number of maximum dissociation sets in trees with given dissociation number
- On the number of connected sets in bounded degree graphs
- Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
- Minimal vertex covers in infinite hypergraphs
- The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number
- Title not available (Why is that?)
This page was built for publication: Enumeration and maximum number of minimal connected vertex covers in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678095)
