3 papers
cs.DM2009
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},…
cs.DM2009
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…
cs.CC2009
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…