Towards a theory of domination in graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset
- Remarks about disjoint dominating sets
- Finding minimum dominating cycles in permutation graphs
- A note on total domination
- Dominating sets and domatic number of circular arc graphs
- A linear algorithm for finding a minimum dominating set in a cactus
- On graphs having domination number half their order
- Line domination in graphs
- Sur le nombre domatique du n-cube et une conjecture de Zelinka. (On the domatic number of the n-cube and a conjecture of Zelinka)
- A survey of the theory of hypercube graphs
- Dominating sets in social network graphs
- Contributions to the theory of domination, independence and irredundance in graphs
- Independent domination in chordal graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Regular totally domatically full graphs
- Domatically critical and domatically full graphs
- The least point covering and domination numbers of a graph
- Maximum number of edges in connected graphs with a given domination number
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
- Disjoint independent dominating sets in graphs
- Real and integer domination in graphs
- Efficient edge domination problems in graphs
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- The domatic number problem
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
- The diversity of domination
- Strong weak domination and domination balance in a graph
- One-node cutsets and the dominating set polytope
- Using maximality and minimality conditions to construct inequality chains
- On upper domination Ramsey numbers for graphs.
- The domatic number of block-cactus graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- Laplacian distribution and domination
- On the \(b\)-domatic number of graphs
- The Roman \(\{2 \}\)-domatic number of graphs
- Novel applications of bipolar fuzzy graphs to decision making problems
- Constrained domatic bipartition on trees
- Domination-complete graphs
- On domination and independence numbers of graphs
- Well irredundant graphs
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
- Nordhaus-Gaddum inequalities for domination in graphs
- The total \(\{k\}\)-domatic number of wheels and complete graphs
- On the independent domination number of regular graphs
- Pairs of disjoint dominating sets and the minimum degree of graphs
- Energy of double dominating bipolar fuzzy graphs
- Star partitions on graphs
- The complexity of total edge domination and some related results on trees
- Resolving dominating partitions in graphs
- Exact and heuristic algorithms for the weighted total domination problem
- A study on triple connected total perfect domination in fuzzy graphs
- Admissible property of graphs in terms of independence number
- Further results on 2-distance coloring of graphs
- Transitivity on subclasses of bipartite graphs
- Isolation of \(k\)-cliques. II
- Domination in fuzzy incidence graphs based on valid edges
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)
- The Roman domatic problem in graphs and digraphs: a survey
- Decreasing the maximum degree of a graph
- The signed edge-domatic number of nearly cubic graphs
- Isolation of cycles
- Isolation of \(k\)-cliques
- Partitioning vertices into in- and out-dominating sets in digraphs
- Outer independent double Roman domination
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- The signed total Roman \(k\)-domatic number of a graph
- On the dominating set polytope
- Nordhaus-Gaddum bounds for locating domination
- A note on the independent domination number in graphs
- \(k\)-tuple total restrained domination in complementary prisms
- On minimal geodetic domination in graphs
- Signed domatic number of a graph
- The signed edge-domatic number of a graph
- Dot product graphs and domination number
- Injective coloring of graphs revisited
- Extensions of the Art Gallery Theorem
- Graphs with small Italian domatic number
- Domination parameters in hypertrees
- Equi independent equitable dominating sets in graphs
- Computing Roman domatic number of graphs
- A Survey of the Game “Lights Out!”
- On the locatic number of graphs
- Approximability results for the converse connected p-centre problem
- Disjunctive total domination in permutation graphs
- Graphs that are not domatically co-critical
- scientific article; zbMATH DE number 4014770 (Why is no real title available?)
- The k-domatic number of a graph
- Domination in generalized Petersen graphs
- On the signed total Roman domination and domatic numbers of graphs
- An algorithm for the inverse distance-2 dominating set of a graph
- Two algorithms for determining a minimum independent dominating set
- Edge-domatic number of a graph
- On k-domatic numbers of graphs
- Remarks on restrained domination and total restrained domination in graphs
- Domination and spectral graph theory
- Fractional dominating parameters
- Rainbow domination in graphs
- Global domination
This page was built for publication: Towards a theory of domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4163261)