Pages that link to "Item:Q4909546"
From MaRDI portal
The following pages link to On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets (Q4909546):
Displaying 16 items.
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- On the dualization in distributive lattices and related problems (Q2030249) (← links)
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842) (← links)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
- (Q5090486) (← links)
- (Q5090998) (← links)
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs (Q5283376) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
