Locally definable vertex set properties are efficiently enumerable

DOI10.1016/j.dam.2020.05.037zbMath1472.05069OpenAlexW3036899539MaRDI QIDQ1983133

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

zbMATH Keywords

complexityenumerationvertex set properties

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Interval graphs and related topics
• Enumeration of maximal irredundant sets for claw-free graphs
• Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
• On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs
• The Private Neighbor Cube
• Treewidth and Pathwidth of Permutation Graphs
• Combinatorial bounds via measure and conquer
• Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants
• On the Enumeration of Minimal Dominating Sets and Related Notions

This page was built for publication: Locally definable vertex set properties are efficiently enumerable