Enumeration of maximal irredundant sets for claw-free graphs
DOI10.1007/978-3-319-57586-5_25zbMATH Open1441.05015OpenAlexW2606890800MaRDI QIDQ5283376FDOQ5283376
Authors: Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi 
Publication date: 21 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_25
Recommendations
- Enumeration of maximal irredundant sets for claw-free graphs
- scientific article; zbMATH DE number 1472169
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- scientific article; zbMATH DE number 4055676
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A fast branching algorithm for cluster vertex deletion
- Exact exponential algorithms.
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Claw-free graphs. V. Global structure
- On maximal independent sets of vertices in claw-free graphs
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On the number of minimal dominating sets on some graph classes
- Combinatorial bounds via measure and conquer
- On the enumeration of minimal dominating sets and related notions
- Enumerating minimal dominating sets in chordal graphs
- Enumerating minimal dominating sets in chordal bipartite graphs
- Trees having many minimal dominating sets
- On the enumeration and counting of minimal dominating sets in interval and permutation graphs
- Polynomial delay algorithm for listing minimal edge dominating sets in graphs
- On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Contributions to the theory of domination, independence and irredundance in graphs
- The Private Neighbor Cube
- Title not available (Why is that?)
- Chordal graphs and upper irredundance, upper domination and independence
Cited In (3)
This page was built for publication: Enumeration of maximal irredundant sets for claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283376)
