Pages that link to "Item:Q387008"
From MaRDI portal
The following pages link to Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008):
Displaying 17 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Completion and decomposition of hypergraphs into dominating sets of graphs (Q322230) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- Enumerating minimal dominating sets in chordal graphs (Q738877) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Locally definable vertex set properties are efficiently enumerable (Q1983133) (← links)
- Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
- An improved exact algorithm for minimum dominating set in chordal graphs (Q2059888) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
- Enumeration and maximum number of minimal dominating sets for chordal graphs (Q2317861) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Minimum Dominating Set for the Prism Graph Family (Q6047426) (← links)
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets (Q6063279) (← links)
- Minimum cost flow problem with conflicts (Q6065835) (← links)
- Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)
