Recommendations
- scientific article; zbMATH DE number 68357
- Total dominating sequences in graphs
- Degree sequences of graphs and dominance order
- Dominator sequences in bipartite graphs
- scientific article; zbMATH DE number 1248188
- scientific article; zbMATH DE number 4200261
- scientific article; zbMATH DE number 30758
- Dominating sequences in grid-like and toroidal graphs
- Dominating Functions and Graphs
- scientific article; zbMATH DE number 6863591
Cites work
- scientific article; zbMATH DE number 3974977 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 3545568 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- Complement reducible graphs
- Domination game and an imagination strategy
- Extremal problems for game domination number
- Realizations of the game domination number
- Reducibility among combinatorial problems
- The splittance of a graph
Cited in
(34)- On the Grundy bondage numbers of graphs
- Graphs with equal Grundy domination and independence number
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Domination number of graphs with minimum degree five
- Uniform length dominating sequence graphs
- Grundy domination and zero forcing in Kneser graphs
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Grundy domination of forests and the strong product conjecture
- Grundy dominating sequences on \(X\)-join product
- An integer programming approach for solving a generalized version of the Grundy domination number
- On graphs all of whose total dominating sequences have the same length
- Zero forcing number, Grundy domination number, and their variants
- Dominator sequences in bipartite graphs
- Z-domination game
- On the L-Grundy domination number of a graph
- Grundy domination and zero forcing in regular graphs
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
- Bounds on zero forcing using (upper) total domination and minimum degree
- Vertex sequences in graphs
- Grundy dominating sequences and zero forcing sets
- On the length of L-Grundy sequences
- A new approach on locally checkable problems
- On Grundy total domination number in product graphs
- How long can one bluff in the domination game?
- The variety of domination games
- Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs
- Computation of Grundy dominating sequences in (co-)bipartite graphs
- Dominating sequences in grid-like and toroidal graphs
- Total dominating sequences in graphs
- Degree sequences of graphs and dominance order
- Grundy domination sequences in generalized corona products of graphs
- Indicated domination game
- Computational aspects of double dominating sequences in graphs
- Facets of the polytope of legal sequences
This page was built for publication: Dominating sequences in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740654)
