Perfect Roman domination: aspects of enumeration and parameterization

DOI10.1007/978-3-031-63021-7_27MaRDI QIDQ7021082zbMATH OpenFDO

Authors Kevin Mann, Henning Fernau

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_27

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A Roman domination chain
• Algorithmic graph theory and perfect graphs
• Algorithmic results on double Roman domination in graphs
• Analysis and enumeration. Algorithms for biological graphs
• Double Roman domination
• Efficient algorithms for Roman domination on some classes of graphs
• Enumeration complexity
• Extremal kernelization: a commemorative paper
• Fundamentals of parameterized complexity
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 4070305 (Why is no real title available?)
• Linear time solvable optimization problems on graphs of bounded clique-width
• Minimal Roman dominating functions: extensions and enumeration
• On the 2-packing differential of a graph
• On the clique-width of some perfect graph classes
• On the double Roman domination in graphs
• On the number of 2-packings in a connected graph
• On the parameterized complexity of short computation and factorization
• Parameterized and Exact Computation
• Parametrized complexity theory.
• Perfect Roman domination in graphs
• Perfect Roman domination in trees
• R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
• Roman \(\{2 \}\)-domination
• Roman census: enumerating and counting Roman dominating functions on graph classes
• Roman dominating influence parameters
• ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
• Roman domination in graphs.
• Roman domination on strongly chordal graphs
• Structures of domination in graphs
• The parameterized complexity of domination-type problems and application to linear codes
• The Turing way to parameterized complexity
• Topics in Domination in Graphs
• Total domination in graphs
• Unique response Roman domination in graphs
• Unique response Roman domination: complexity and algorithms
• Weighted efficient domination problem on some perfect graphs

Cited in

(4)

• Enumerating minimal defensive alliances
• Domination in diameter-two graphs and the 2-club cluster vertex deletion parameter
• Extension perfect Roman domination
• Roman hitting functions

This page was built for publication: Perfect Roman domination: aspects of enumeration and parameterization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021082)