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