Triangulability of convex graphs and convex skewness
Suppose F is a subgraph of a convex complete graph Kn and F contains no boundary edge of Kn and |E(F)|≤n−1. We determine necessary and sufficient conditions on F such that Kn−F admits a triangulation. For |E(F)|≥n, we investigate the possibility of placing F in Kn such that Kn−F admits a triangulati...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
World Scientific
2021
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/93441/ https://www.worldscientific.com/doi/10.1142/S1793830921501469 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|