Minimal Roman dominating functions: extensions and enumeration
From MaRDI portal
Publication:6043174
DOI10.1007/978-3-031-15914-5_1arXiv2204.04765OpenAlexW4312724413MaRDI QIDQ6043174
Henning Fernau, Kevin Mann, Faisal N. Abu-Khzam
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.04765
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Roman domination on strongly chordal graphs
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On the roman domination in the lexicographic product of graphs
- Combinatorics for smaller kernels: the differential of a graph
- On the number of minimal dominating sets on some graph classes
- Enumerating minimal dominating sets in chordal graphs
- Upper bounds on Roman domination numbers of graphs
- A note on Roman domination in graphs
- Enumerating minimal dominating sets in chordal bipartite graphs
- Data reductions and combinatorial bounds for improved approximation algorithms
- Efficient algorithms for Roman domination on some classes of graphs
- Roman domination in regular graphs
- On the Roman domination number of a graph
- Roman domination in graphs.
- The many facets of upper domination
- On the complexity of solution extension of optimization problems
- A complexity theory for hard enumeration problems
- Extension of some edge graph problems: standard and parameterized complexity
- Computing the differential of a graph: hardness, approximability and exact algorithms
- Invited talks
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
- Exact Algorithms for Weak Roman Domination
- Roman Domination on 2-Connected Graphs
- The Minimal Hitting Set Generation Problem: Algorithms and Computation
- The differential and the roman domination number of a graph
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
- ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
- Extremal Problems for Roman Domination
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Dual subimplicants of positive Boolean functions
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs
- Topics in Domination in Graphs
- Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
- On the Enumeration of Minimal Dominating Sets and Related Notions
- Roman domination in Cartesian product graphs and strong product graphs
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
- A Roman domination chain
This page was built for publication: Minimal Roman dominating functions: extensions and enumeration
