Separability generalizes Dirac's theorem
Discrete Applied Mathematics
On finding minimum-diameter clique trees
Nordic Journal of Computing
A Unified View of Graph Searching
SIAM Journal on Discrete Mathematics
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
Information Processing Letters
| Hi-index | 0.04 |
Let G be a graph with vertex set V. A moplex of G is both a clique and a module whose neighborhood is a minimal separator in G or empty. A moplex ordering of G is an ordered partition (X"1,X"2,...,X"k) of V for some integer k into moplexes which are defined in the successive transitory elimination graphs, i.e., for 1=