Derek G. Corneil
ABSTRACT
No abstract available.
Index Terms
- LBFS orderings and cocomparability graphs
Recommendations
End-vertices of LBFS of (AT-free) bigraphs
Lexicographic Breadth First Search (LBFS) is one of fundamental graph search algorithms that has numerous applications, including recognition of graph classes, computation of graph parameters, and detection of certain graph structures. The well-known ...
On the intersection of tolerance and cocomparability graphs
Tolerance graphs have been extensively studied since their introduction, due to their interesting structure and their numerous applications, as they generalize both interval and permutation graphs in a natural way. It has been conjectured by Golumbic, ...
Linear Orderings of Subfamilies of AT-Free Graphs
Asteroidal triple free (AT-free) graphs have been introduced as a generalization of interval graphs, since interval graphs are exactly the chordal AT-free graphs. While for interval graphs it is obvious that there is always a linear ordering of the ...
Comments