scientific article
From MaRDI portal
Publication:3797234
zbMath0652.05056MaRDI QIDQ3797234
Arthur S. Finbow, Richard J. Nowakowski, Bert L. Hartnell
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Strongly well-covered graphs ⋮ Closed neighborhood ideals of finite simple graphs ⋮ \((C_3, C_4, C_5, C_7)\)-free almost well-dominated graphs ⋮ Graphs with maximal induced matchings of the same size ⋮ Well-dominated graphs without cycles of lengths 4 and 5 ⋮ Reconfiguring dominating sets in some well-covered and other classes of graphs ⋮ On well-dominated graphs ⋮ Well irredundant graphs ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ On well-edge-dominated graphs ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ A characterization of well-dominated Cartesian products ⋮ A note on connected dominating sets of distance-hereditary graphs ⋮ Well-indumatched Trees and Graphs of Bounded Girth ⋮ Simultaneous domination in graphs ⋮ Triangulations and equality in the domination chain ⋮ The enclaveless competition game ⋮ Well paired-dominated graphs ⋮ A revision and extension of results on 4-regular, 4-connected, claw-free graphs ⋮ Domination related parameters in the generalized lexicographic product of graphs ⋮ Distance Domination in Graphs ⋮ Well-totally-dominated graphs ⋮ The uniformity space of hypergraphs and its applications ⋮ On well-dominated direct, Cartesian and strong product graphs ⋮ On weakly connected domination in graphs. II. ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication:
