Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Under an Elsevier user license
open archive
Keywords
Algorithms
Graph classes
Hole-free graphs
Diamond-free graphs
LexBFS
Clique separator decomposition
Recognition time bound
Minimal triangulations
Cited by (0)
Copyright © 2015 Published by Elsevier B.V.