Enumeration of maximal irredundant sets for claw-free graphs

DOI10.1007/978-3-319-57586-5_25MaRDI QIDQ5283376zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

structural graph theory

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

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

Cites work

• scientific article; zbMATH DE number 4055676 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• A fast branching algorithm for cluster vertex deletion
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
• Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
• Chordal graphs and upper irredundance, upper domination and independence
• Claw-free graphs. V. Global structure
• Combinatorial bounds via measure and conquer
• Contributions to the theory of domination, independence and irredundance in graphs
• Enumerating minimal dominating sets in chordal bipartite graphs
• Enumerating minimal dominating sets in chordal graphs
• Exact exponential algorithms.
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• On maximal independent sets of vertices in claw-free graphs
• On the enumeration and counting of minimal dominating sets in interval and permutation graphs
• On the enumeration of minimal dominating sets and related notions
• On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets
• On the number of minimal dominating sets on some graph classes
• Polynomial delay algorithm for listing minimal edge dominating sets in graphs
• The Private Neighbor Cube
• Trees having many minimal dominating sets

Cited in

(3)

• Enumeration and maximum number of maximal irredundant sets for chordal graphs
• Enumeration of maximal irredundant sets for claw-free graphs
• Enumeration and maximum number of maximal irredundant sets for chordal graphs

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)