2 papers
cs.DM2015
Equivalence of the filament and overlap graphs of subtrees of limited trees
Jessica Enright, Lorna Stewart
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of s…
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…