Dominating sequences in graphs
From MaRDI portal
Publication:740654
DOI10.1016/j.disc.2014.07.016zbMath1300.05210OpenAlexW2115943606MaRDI QIDQ740654
Tanja Gologranc, Martin Milanič, Boštjan Brešar, Douglas F. Rall, Romeo Rizzi
Publication date: 4 September 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.07.016
Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Total dominating sequences in graphs ⋮ A new approach on locally checkable problems ⋮ Grundy domination of forests and the strong product conjecture ⋮ Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ Total dominating sequences in trees, split graphs, and under modular decomposition ⋮ Domination number of graphs with minimum degree five ⋮ Uniform length dominating sequence graphs ⋮ On the L-Grundy domination number of a graph ⋮ Dominator sequences in bipartite graphs ⋮ On the length of L-Grundy sequences ⋮ Facets of the polytope of legal sequences ⋮ Graphs with equal Grundy domination and independence number ⋮ Computational aspects of double dominating sequences in graphs ⋮ Z-domination game ⋮ Computation of Grundy dominating sequences in (co-)bipartite graphs ⋮ Unnamed Item ⋮ Zero forcing number, Grundy domination number, and their variants ⋮ On Grundy total domination number in product graphs ⋮ Grundy domination and zero forcing in regular graphs ⋮ Dominating sequences in grid-like and toroidal graphs ⋮ Grundy dominating sequences and zero forcing sets ⋮ How long can one bluff in the domination game? ⋮ The variety of domination games ⋮ 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 ⋮ Grundy domination and zero forcing in Kneser graphs ⋮ Grundy dominating sequences on \(X\)-join product ⋮ GRUNDY DOMINATION SEQUENCES IN GENERALIZED CORONA PRODUCTS OF GRAPHS ⋮ Vertex sequences in graphs
Cites Work
