Lexicographic Depth First Search (LexDFS) is a special variant of a Dept...
A vertex in a graph is simplicial if its neighborhood forms a clique. We...
Graph searches and the corresponding search trees can exhibit important
...
End vertices of graph searches can exhibit strong structural properties ...
An asteroidal triple free graph is a graph such that for every independe...
share