edgesInMinimalTriangulation
P39252
predicate
Indicates that the specified edges are exactly those that appear in at least one minimal triangulation (chordal completion with the fewest added edges) of a given graph.
Sample triples (1)
| Subject | Object |
|---|---|
| Klein quartic | 84 ⓘ |