Pages that link to "Item:Q2482884"
From MaRDI portal
The following pages link to Triangulating with high connectivity. (Q2482884):
Displayed 7 items.
- Parity-constrained triangulations with Steiner points (Q489340) (← links)
- On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- Four-connected triangulations of planar point sets (Q2351013) (← links)
- Compatible triangulations and point partitions by series-triangular graphs (Q2495951) (← links)
- Cubic plane graphs on a given point set (Q5891915) (← links)