scientific article; zbMATH DE number 842019

MaRDI QIDQ4862239zbMATH OpenFDO

Authors Marilynn L. Livingston, Q. F. Stout

Publication date 29 July 1996

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Extremal problems in graph theory (05C35)

Recommendations

• A note on the complexity of minimum dominating set
• scientific article; zbMATH DE number 867663
• Graph-Theoretic Concepts in Computer Science
• On the Algorithmic Complexity of Total Domination
• Dominating sets and domatic number of circular arc graphs

Cited in

(16)

• An explicit construction of optimal dominating and [1, 2]–dominating sets in grid
• A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs
• Generic algorithms for some decision problems on fasciagraphs and rotagraphs
• On domination numbers of graphs bundles
• A new lower bound for the domination number of complete cylindrical grid graphs
• The domination number of \(C_n\square P_m\) for \(n\equiv 2\pmod{5} \)
• Independent domination of grids
• Critical cyclic patterns related to the domination number of the torus
• A note on the complexity of minimum dominating set
• Efficient domination in circulant graphs with two chord lengths
• Strong restrained domination number on trees and product of graphs: An algorithmic approach
• Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes
• A Survey of the Game “Lights Out!”
• 1,2-efficiency in grid graphs
• Number of dominating sets in cylindric square grid graphs
• On 2-limited packings of complete grid 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 Q4862239)