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: | Ali, Niran Abbas, Chia, Gek L., Trao, Hazim Michman, Kilicman, Adem |
---|---|
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!
|
Similar Items
-
Restricted triangulation on circulant graphs
by: Ali, Niran Abbas, et al.
Published: (2018) -
G-angulability of convex geometric graphs
by: al-Hakeem, Niran Abbas Ali
Published: (2018) -
Packing 1-plane Hamiltonian cycles in complete geometric graphs
by: Trao, Hazim Michman, et al.
Published: (2019) -
On geodesic strongly E-convex sets and geodesic strongly E-convex functions
by: Kilicman, Adem, et al.
Published: (2015) -
On convexity in product of Riemannian manifolds
by: Saleh, Wedad, et al.
Published: (2016)