Enumeration and maximum number of maximal irredundant sets for chordal graphs
From MaRDI portal
Publication:5919544
DOI10.1016/j.dam.2019.03.018zbMath1416.05267OpenAlexW2937327260WikidataQ128117050 ScholiaQ128117050MaRDI QIDQ5919544
Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi, Mathieu Liedloff
Publication date: 17 July 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.03.018
Related Items
Enumeration of minimal connected dominating sets for chordal graphs ⋮ An improved exact algorithm for minimum dominating set in chordal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On the number of minimal dominating sets on some graph classes
- Exact exponential algorithms.
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Enumerating minimal dominating sets in chordal graphs
- The irredundance number and maximum degree of a graph
- Contributions to the theory of domination, independence and irredundance in graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Domination and irredundance in cubic graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Irredundant and perfect neighbourhood sets in trees
- Enumeration of maximal irredundant sets for claw-free graphs
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Changing upper irredundance by edge addition
- Algorithmic graph theory and perfect graphs
- Nordhaus-Gaddum results for CO-irredundance in graphs
- The complexity of irredundant sets parameterized by size
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Representation of a finite graph by a set of intervals on the real line
- Total Domination and Irredundance in Weighted Interval Graphs
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- The Private Neighbor Cube
- Irredundance and Maximum Degree in Graphs
- Generalised irredundance in graphs: Nordhaus-Gaddum bounds
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Combinatorial bounds via measure and conquer
- On the Enumeration of Minimal Dominating Sets and Related Notions
- Parameterized Algorithms
This page was built for publication: Enumeration and maximum number of maximal irredundant sets for chordal graphs
