On Convex Graphs Having Plane Spanning Subgraph of Certain Type

2019/06/13 by Niran Abbas Ali, Gek L. Chiab, Ali, Niran Abbas +5
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Graph Labeling and Dimension Problems

paper · pdf · doi:10.48550/arxiv.1906.05607

openalex publication_date 2019/06/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Motivated by a result of [17], we determine necessary and sufficient conditions on F\/ with |E(F)| ≤ n-1\/ for which K_n - F\/ admits a g-angulation. For |E(F)| ≥ n\/, we investigate the possibility of placing F\/ in K_n\/ such that K_n -F\/ admits a g-angulation for certain families of graphs F\/.

Related

• Which point sets admit a k-angulation?
• An extension of a result concerning convex geometric graphs
• On the maximum number of edges in plane graph with fixed exterior face\n degree
• Regular systems of paths and families of convex sets in convex position
• Triangulability of Convex Graphs and Convex Skewness