scientific article
From MaRDI portal
Publication:3206969
zbMath0417.05020MaRDI QIDQ3206969
Terry Beyer, Stephen T. Hedetniemi, Andrzej Proskurowski, Sandra M. Hedetniemi
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
A recurrence template for several parameters in series-parallel graphs ⋮ On the independent dominating set polytope ⋮ Domination and irredundance in cubic graphs ⋮ On independent \([1, 2\)-sets in trees] ⋮ THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS ⋮ Independent domination in finitely defined classes of graphs ⋮ Independent domination in chordal graphs ⋮ Dominating sets in perfect graphs ⋮ On minimum dominating sets with minimum intersection ⋮ A note on an induced subgraph characterization of domination perfect graphs ⋮ Cores of simplicial complexes ⋮ Paired-domination problem on distance-hereditary graphs ⋮ Upper Clique Transversals in Graphs ⋮ An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF) ⋮ Anti-forcing numbers of perfect matchings of graphs ⋮ The Private Neighbor Concept ⋮ On approximating the minimum independent dominating set ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ A Survey of the Game “Lights Out!” ⋮ Domination, independent domination, and duality in strongly chordal graphs ⋮ Unique irredundance, domination and independent domination in graphs ⋮ Efficient edge domination problems in graphs ⋮ What is the difference between the domination and independent domination numbers of a cubic graph? ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication:
