scientific article
From MaRDI portal
Publication:3688433
zbMath0571.05045MaRDI QIDQ3688433
Stephen T. Hedetniemi, John Pfaff, Renu C. Laskar
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)
Related Items (17)
A recurrence template for several parameters in series-parallel graphs ⋮ Labeling algorithms for domination problems in sun-free chordal graphs ⋮ Total domination in block graphs ⋮ On the computational complexity of upper total domination ⋮ The bottleneck independent domination on the classes of bipartite graphs and block graphs. ⋮ Permutation graphs: Connected domination and Steiner trees ⋮ On minimum dominating sets with minimum intersection ⋮ Dominating cliques in graphs ⋮ Efficient algorithms for the conditional covering problem ⋮ Total domination in interval graphs ⋮ Small \(k\)-pyramids and the complexity of determining \(k\) ⋮ Dominating cliques in graphs ⋮ Well-totally-dominated graphs ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ Positive influence domination in graphs ⋮ A Survey of the Game “Lights Out!” ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication:
