Dominating Sets in Chordal Graphs

Cited In (98)

Distance Domination in Graphs
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
A linear time algorithm for liar's domination problem in proper interval graphs
The neighborhood polynomial of chordal graphs
Optimization problems in multiple subtree graphs
Permutation graphs: Connected domination and Steiner trees
The algorithmic complexity of minus domination in graphs
Labeling algorithms for domination problems in sun-free chordal graphs
Chordal graphs and upper irredundance, upper domination and independence
Defending the Roman Empire from multiple attacks
The complexity of domination problems in circle graphs
On the domatic number of interval graphs
Counting labelled chordal graphs
Total domination in block graphs
Parameterized dominating set problem in chordal graphs: Complexity and lower bound
On the geodetic and geodetic domination numbers of a graph
Clustering and domination in perfect graphs
The diversity of domination
A width parameter useful for chordal and co-comparability graphs
On total \(f\)-domination: polyhedral and algorithmic results
Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
Bibliography on domination in graphs and some basic definitions of domination parameters
Faster algorithms for vertex partitioning problems parameterized by clique-width
On the algorithmic complexity of edge total domination
Some remarks on the geodetic number of a graph
The algorithmic complexity of mixed domination in graphs
Dominating sets for split and bipartite graphs
Defending the Roman Empire---a new strategy
On \(f\)-domination: polyhedral and algorithmic results
Domination, independent domination, and duality in strongly chordal graphs
Dominating cliques in graphs
Some parallel algorithms on interval graphs
Combinatorial analysis (nonnegative matrices, algorithmic problems)
Two algorithms for determining a minimum independent dominating set
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
The weighted perfect domination problem
Dominating sets in perfect graphs
Bounds for the connected domination number of maximal outerplanar graphs
A linear algorithm for finding a minimum dominating set in a cactus
Intersection graphs of non-crossing paths
Computing a minimum outer-connected dominating set for the class of chordal graphs
Dominating sets and domatic number of circular arc graphs
Real and integer domination in graphs
Improved algorithms and complexity results for power domination in graphs
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS
A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
On the algorithmic complexity of twelve covering and independence parameters of graphs
Clique tree generalization and new subclasses of chordal graphs
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
Dominating cliques in graphs
On the Algorithmic Complexity of Total Domination
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
Total domination in interval graphs
A unified approach to domination problems on interval graphs
Total domination in interval graphs revisited
Algorithmic Aspects of Disjunctive Total Domination in Graphs
Total Roman {2}-domination in graphs
Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
R-domination of block graphs
An optimal algorithm for finding dominating cycles in circular-arc graphs
Efficient algorithms for shortest distance queries on special classes of polygons
Tree-decompositions with bags of small diameter
Representations of graphs and networks (coding, layouts and embeddings)
On defensive alliances and strong global offensive alliances
Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs
Title not available (Why is that?)
Weighted Upper Edge Cover: Complexity and Approximability
On 3-degree 4-chordal graphs
The Neighborhood Polynomial of Chordal Graphs
Title not available (Why is that?)
Algorithmic aspects of k-part degree restricted domination in graphs
Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
Paired-domination problem on distance-hereditary graphs
On \(H\)-topological intersection graphs
On the vertices belonging to all, some, none minimum dominating set
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
Dominating set of rectangles intersecting a straight line
Algorithmic aspects of \(\{P_k\}\)-isolation in graphs and extremal graphs for a \(\{P_3\}\)-isolation bound
On strictly chordality-\(k\) graphs
New geometric representations and domination problems on tolerance and multitolerance graphs
Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage
On the tractability of optimization problems on \(H\)-graphs
Structural parameterizations with modulator oblivion
Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
Vector domination in split-indifference graphs
Co-Roman domination in graphs
Domination problems on P₅-free graphs
An improved exact algorithm for minimum dominating set in chordal graphs
The semitotal domination problem in block graphs
The \(k\)-neighbor, \(r\)-domination problems on interval graphs
Shiftable intervals
Minimum dominating sets of intervals on lines
The strong domination problem in block graphs and proper interval graphs
Inverse roman domination in graphs
Algorithm and hardness results on neighborhood total domination in graphs
Revising Johnson's table for the 21st century

This page was built for publication: Dominating Sets in Chordal Graphs

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