Enumeration and maximum number of maximal irredundant sets for chordal graphs
From MaRDI portal
Publication:5919544
Recommendations
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- Counting the number of independent sets in chordal graphs
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- Graph-Theoretic Concepts in Computer Science
- Enumeration of maximal irredundant sets for claw-free graphs
Cites work
- scientific article; zbMATH DE number 4055676 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1229623 (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?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Algorithmic graph theory and perfect graphs
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Changing upper irredundance by edge addition
- Chordal graphs and upper irredundance, upper domination and independence
- Combinatorial bounds via measure and conquer
- Contributions to the theory of domination, independence and irredundance in graphs
- Domination and irredundance in cubic graphs
- Enumerating minimal dominating sets in chordal graphs
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- Exact exponential algorithms.
- Fundamentals of parameterized complexity
- Generalised irredundance in graphs: Nordhaus-Gaddum bounds
- Graph Classes: A Survey
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Irredundance and Maximum Degree in Graphs
- Irredundant and perfect neighbourhood sets in trees
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Nordhaus-Gaddum results for CO-irredundance in graphs
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- On the enumeration of minimal dominating sets and related notions
- On the number of minimal dominating sets on some graph classes
- Parameterized algorithms
- Properties of Hereditary Hypergraphs and Middle Graphs
- Representation of a finite graph by a set of intervals on the real line
- The Private Neighbor Cube
- The complexity of irredundant sets parameterized by size
- The irredundance number and maximum degree of a graph
- Topics in Intersection Graph Theory
- Total Domination and Irredundance in Weighted Interval Graphs
Cited in
(7)- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Counting the number of independent sets in chordal graphs
- Enumeration of minimal connected dominating sets for chordal graphs
- An improved exact algorithm for minimum dominating set in chordal graphs
This page was built for publication: Enumeration and maximum number of maximal irredundant sets for chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919544)
