Locally definable vertex set properties are efficiently enumerable

DOI10.1016/J.DAM.2020.05.037zbMATH Open1472.05069OpenAlexW3036899539MaRDI QIDQ1983133FDOQ1983133

Authors: Sarah Blind, Nadia Creignou, Frédéric Olive 

Publication date: 15 September 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.05.037

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

zbMATH Keywords

complexityenumerationvertex set properties

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Enumerating minimal connected dominating sets in graphs of bounded chordality
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• On the number of minimal dominating sets on some graph classes
• Combinatorial bounds via measure and conquer
• On the enumeration of minimal dominating sets and related notions
• Treewidth and Pathwidth of Permutation Graphs
• On the enumeration and counting of minimal dominating sets in interval and permutation graphs
• The Private Neighbor Cube
• Interval graphs and related topics
• Enumeration of maximal irredundant sets for claw-free graphs
• Enumerating minimal dominating sets in \(K_t\)-free graphs and variants

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)