scientific article
From MaRDI portal
Publication:4017197
zbMath0761.05091MaRDI QIDQ4017197
Michael R. Fellows, Mark N. Hoover
Publication date: 16 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (36)
Regular codes in regular graphs are difficult ⋮ A dichotomy for weighted efficient dominating sets with bounded degree vertices ⋮ Unnamed Item ⋮ Weighted efficient domination problem on some perfect graphs ⋮ Efficient domination through eigenvalues ⋮ Kernelization of edge perfect code and its variants ⋮ A Taxonomy of Perfect Domination ⋮ On the perfect differential of a graph ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ Hereditary Efficiently Dominatable Graphs ⋮ Weighted domination of cocomparability graphs ⋮ Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems ⋮ Efficient minus and signed domination in graphs ⋮ \([1,2\)-sets and \([1,2]\)-total sets in trees with algorithms] ⋮ A note on the fair domination number in outerplanar graphs ⋮ A characterization of perfect Roman trees ⋮ Perfect Italian domination on planar and regular graphs ⋮ Weighted efficient domination in two subclasses of \(P_6\)-free graphs ⋮ Perfect domination and small cycles ⋮ A generalization of Lee codes ⋮ Generalized perfect domination in graphs ⋮ Fair domination number in cactus graphs ⋮ \([1,2\)-sets in graphs] ⋮ Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs ⋮ Fair total domination number in cactus graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy ⋮ Parameterized complexity of minimum membership dominating set ⋮ Efficient domination for classes of \(P_6\)-free graphs ⋮ Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs ⋮ Algorithms for unipolar and generalized split graphs ⋮ On perfect and quasiperfect dominations in graphs ⋮ Rainbow perfect domination in lattice graphs ⋮ Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs ⋮ Outer complete fair domination in graphs ⋮ Equitable fair domination in graphs
This page was built for publication:
