Triangulability of convex graphs and convex skewness

DOI10.1142/S1793830921501469zbMath1491.05060arXiv1611.09033OpenAlexW3174176734MaRDI QIDQ5083873

Niran Abbas Ali, Hazim Michman Trao, Adem Kilicman, Gek Ling Chia

Publication date: 21 June 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.09033

zbMATH Keywords

triangulationgeometric graphconvex complete graphconvex skewness

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal triangulations of graphs: a survey
• Triangulating a simple polygon in linear time
• Chromatic number and skewness
• On the chromatic number of skew graphs
• Plane graphs with straight edges whose bounded faces are acute triangles
• Properties of \(\pi\)-skew graphs with applications
• Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
• On the skewness of Cartesian products with trees
• On the skewness of the join of graphs
• Graphs of triangulations and perfect matchings
• A Generalization of the 5-Color Theorem
• Triangulated polygons and frieze patterns

This page was built for publication: Triangulability of convex graphs and convex skewness