4 citations · 4 across the 5 of their papers we have counts for
5 papers
Efficient Domination for Some Subclasses of -Free Graphs in Polynomial Time
Andreas Brandstädt, Elaine M. Eschen, Erik Friese
Let be a finite undirected graph. A vertex {\em dominates} itself and all its neighbors in . A vertex set is an {\em efficient dominating set} (\emph{e.d.}\ for short) o…
Algorithms for Unipolar and Generalized Split Graphs
Elaine M. Eschen, Xiaoqiang Wang
A graph is a {\it unipolar graph} if there exits a partition such that, is a clique and induces the disjoint union of cliques. The complement…
Finding a sun in building-free graphs
Elaine M. Eschen, Chinh T. Hoang, Jeremy P. Spinrad +1
Deciding whether an arbitrary graph contains a sun was recently shown to be NP-complete. We show that whether a building-free graph contains a sun can be decided in O(min$\{m{n^3},…
On graphs without a C4 or a diamond
Elaine M. Eschen, Chinh T. Hoang, Jeremy P. Spinrad +1
We consider the class of (C4, diamond)-free graphs; graphs in this class do not contain a C4 or a diamond as an induced subgraph. We provide an efficient recognition algorithm for…
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
Elaine M. Eschen, Chinh T. Hoang, R. Sritharan +1
In an article [3] published recently in this journal, it was shown that when k >= 3, the problem of deciding whether the distinguishing chromatic number of a graph is at most k is…