scientific article; zbMATH DE number 1095172

Authors

Publication date 8 December 1997

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06)

Cited in

(only showing first 100 items - show all)

Efficiency in exponential time for domination-type problems
Upper bounds on the paired-domination number
An upper bound on the domination number of a graph with minimum degree 2
\(k\)-tuple domination in graphs
Paired-domination in \(P_{5}\)-free graphs
Total domination in graphs with given girth
Roman domination in regular graphs
Connected domination of regular graphs
On the domination number of generalized petersen graphs \(P(n,2)\)
The exact domination number of the generalized Petersen graphs
A note on dominating sets and average distance
Minimum fractional dominating functions and maximum fractional packing functions
On the \(\{k\}\)-domination number of Cartesian products of graphs
An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm
On total domination vertex critical graphs of high connectivity
Vertex and edge covers with clustering properties: Complexity and algorithms
Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
On the diameter of a domination dot-critical graph
Average distances and distance domination numbers
Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
Distance paired-domination problems on subclasses of chordal graphs
Total domination in partitioned graphs
Vertex domination of generalized Petersen graphs
Total domination in planar graphs of diameter two
A survey of stratified domination in graphs
Domination with exponential decay
On global domination critical graphs
Remarks about disjoint dominating sets
On the algorithmic complexity of twelve covering and independence parameters of graphs
Graphs with large restrained domination number
Minus domination in graphs
On perfect neighborhood sets in graphs
On the differences between the upper irredundance, upper domination and independence numbers of a graph
Lower bounds on the minus domination and \(k\)-subdomination numbers.
Defending the Roman Empire from multiple attacks
Stratification and domination in graphs
Changing and unchanging domination: A classification
\(H\)-domination in graphs
On upper domination Ramsey numbers for graphs.
On connected k-domination numbers of graphs.
Signed total domination in graphs.
The bottleneck independent domination on the classes of bipartite graphs and block graphs.
On the distribution of the domination number for random class cover catch digraphs
Perfect edge domination and efficient edge domination in graphs
On upper transversals in 3-uniform hypergraphs
Domination in some subclasses of bipartite graphs
A note on Roman domination of digraphs
Computing a minimum paired-dominating set in strongly orderable graphs
On approximating (connected) 2-edge dominating set by a tree
On the global offensive alliance in unicycle graphs
A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree
Domination parameters with number 2: interrelations and algorithmic consequences
Cubic graphs with total domatic number at least two
Domination parameters of a graph and its complement
On the total \(k\)-domination in graphs
On upper bounds for the independent transversal domination number
Total domination stability in graphs
Extremal hypergraphs for matching number and domination number
Bounds on the domination number of a digraph
Weak \(\{2\}\)-domination number of Cartesian products of cycles
Nordhaus-Gaddum bounds for total Roman domination
Graphs with few total dominating sets
Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs
On computing a minimum secure dominating set in block graphs
On -domination in graphs
Total domination versus domination in cubic graphs
The complexity of secure domination problem in graphs
Total domination versus paired-domination in regular graphs
On the global Roman domination number in graphs
Some results for chessboard separation problems
On the co-Roman domination in graphs
On the total Roman domination in trees
On the total forcing number of a graph
Paired-domination in claw-free graphs with minimum degree at least three
Algorithmic aspects of semitotal domination in graphs
On total \(f\)-domination: polyhedral and algorithmic results
The complexity of dominating set in geometric intersection graphs
Domination in 4-regular Knödel graphs
Algorithm to find a maximum 2-packing set in a cactus
Convex and isometric domination of (weak) dominating pair graphs
Subexponential fixed-parameter algorithms for partial vector domination
A note on independent vertex-edge domination in graphs
2-domination number of generalized Petersen graphs
Dominating sets in intersection graphs of finite groups
The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
Restricted total domination in graphs
Secure total domination in graphs: bounds and complexity
Graphs with large total 2-rainbow domination number
Defending the Roman Empire---a new strategy
Parameterized complexity of vertex colouring
The weighted independent domination problem is NP-complete for chordal graphs
Total domination subdivision numbers of trees
Stratification and domination in graphs. II
Pairs of disjoint dominating sets in connected cubic graphs
Girth and total domination in graphs
Total domination and the Caccetta-Häggkvist conjecture
On the independent domination number of regular graphs
Power domination in circular-arc graphs

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 Q4368729)