Locally definable vertex set properties are efficiently enumerable
From MaRDI portal
(Redirected from Publication:1983133)
Recommendations
- On the enumeration and counting of minimal dominating sets in interval and permutation graphs
- Enumeration of minimal dominating sets and variants
- Enumeration of minimal connected dominating sets for chordal graphs
- Efficient enumeration of dominating sets for sparse graphs
- Enumerating minimal connected dominating sets in graphs of bounded chordality
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Combinatorial bounds via measure and conquer
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Enumerating minimal dominating sets in \(K_t\)-free graphs and variants
- Enumeration of maximal irredundant sets for claw-free graphs
- Graph theory
- Interval graphs and related topics
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- 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 number of minimal dominating sets on some graph classes
- The Private Neighbor Cube
- Treewidth and Pathwidth of Permutation Graphs
This page was built for publication: Locally definable vertex set properties are efficiently enumerable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1983133)