scientific article; zbMATH DE number 3596896
From MaRDI portal
Publication:4163262
Cited in
(45)- A linear algorithm for finding a minimum dominating set in a cactus
- An extremal problem for edge domination insensitive graphs
- Contributions to the theory of domination, independence and irredundance in graphs
- R-domination of block graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Domatically critical and domatically full graphs
- An interpolation theorem for partitions which are indivisible with respect to cohereditary properties
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
- The domatic number problem
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
- One-node cutsets and the dominating set polytope
- On domination and independence numbers of graphs
- Isolation of \(k\)-cliques. II
- Decreasing the maximum degree of a graph
- Isolation of cycles
- Isolation of \(k\)-cliques
- Critical concepts in domination
- On the dominating set polytope
- Bounds on the k-domination number of a graph
- Extensions of the Art Gallery Theorem
- On the Algorithmic Complexity of Total Domination
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- scientific article; zbMATH DE number 3739597 (Why is no real title available?)
- A note on domatically critical and cocritical graphs
- scientific article; zbMATH DE number 5913 (Why is no real title available?)
- Common extremal graphs for three inequalities involving domination parameters
- Total domination in interval graphs
- An upper bound on the double Roman domination number
- Isolation of connected graphs
- A study of an undirected graph on a finite subset of natural numbers
- Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes
- NDC pebbling number for some class of graphs
- Isolation of regular graphs and \(k\)-chromatic graphs
- Isolation of squares in graphs
- Theoretical studies of the k-strong Roman domination problem
- A study on Roman domination in deg-centric graphs
- Solution to a 3-path isolation problem for subcubic graphs
- Bounds relating generalized domination parameters
- Isolation of regular graphs, stars and k-chromatic graphs
- In-domatic number and some operations in digraphs
- Proof of a conjecture on isolation of graphs dominated by a vertex
- Solution to a problem on isolation of 3-vertex paths
- Dominating sets for split and bipartite graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- The weighted perfect domination problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4163262)