The articles of this volume will be reviewed individually under the abbreviation ``Topics on domination, Ann. Discrete Math. 48 (1991).
Recommendations
Cited in
(32)- Blockbusting and domineering
- The diversity of domination
- \(r\)-dominating cliques in graphs with hypertree structure
- Dominating sets whose closed stars form spanning trees
- A note on \(r\)-dominating cliques
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- The many facets of upper domination
- Domination cover rubbling
- Paired-domination problem on distance-hereditary graphs
- Number of dominating sets in cylindric square grid graphs
- Perfect domination ratios of Archimedean lattices
- A linear-time algorithm for weighted paired-domination on block graphs
- Critical concepts in domination
- A linear-time algorithm for paired-domination on circular-arc graphs
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- (1, 2)-DOMINATION IN GRAPHS UNDER SOME BINARY OPERATIONS
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
- Dominating cliques in distance-hereditary graphs
- r-Domination problems on homogeneously orderable graphs
- Doubly connected domination in the join and Cartesian product of some graphs
- Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge
- scientific article; zbMATH DE number 7690927 (Why is no real title available?)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Leaf sector covers with applications on circle graphs
- Graphs on groups in terms of the order of elements: a review
- Some new results on captive dominating sets in graphs
- The split (D,C) number of a graph and its implications
- Computation of minimum d-hop connected dominating set of trees in O(n) time
- An optimal algorithm for computing minimum k-hop dominating set of permutation graphs
- Combinatorial aspects of the sensor location problem
- Dominance made simple
This page was built for publication: Topics on domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1188929)
