13 citations · 36 across the 16 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DM2016
Upper Domination: towards a dichotomy through boundary properties
Hassan AbouEisha, Shahid Hussain, Vadim Lozin +3
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally N…
math.CO2016
Graphs vertex-partitionable into strong cliques
Ademir Hujdurović, Martin Milanič, Bernard Ries
A graph is said to be well-covered if all its maximal independent sets are of the same size. In 1999, Yamashita and Kameda introduced a subclass of well-covered graphs, called loca…