Publication:4858149
From MaRDI portal
zbMath0835.68089MaRDI QIDQ4858149
Johannes H. Hattingh, Michael A. Henning, Peter J. Slater
Publication date: 6 February 1996
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
Related Items
Unnamed Item, The complexity of open k-monopolies in graphs for negative k, Dominating functions with integer values in graphs—a survey, Upper bounds on the signed (\(k, k\))-domatic number, Complexity of majority monopoly and signed domination problems, Bounds on the signed domatic number, Variations of \(Y\)-dominating functions on graphs, An application of the Turán theorem to domination in graphs, Discrepancy and signed domination in graphs and hypergraphs, The signed domatic number of some regular graphs, Some remarks on the signed domatic number of graphs with small minimum degree, Efficient minus and signed domination in graphs, Signed total domination in graphs., On complexities of minus domination, Minimum monopoly in regular and tree graphs, Signed domatic number of a graph, On Complexities of Minus Domination, Algorithms and Hardness for Signed Domination, Algorithms and Complexity of Signed, Minus, and Majority Domination, Signed and Minus Dominating Functions in Graphs
