Dominating Sets in Chordal Graphs

Cited in

(only showing first 100 items - show all)

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

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)