Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Triangulability of convex graphs and convex skewness

    https://doi.org/10.1142/S1793830921501469Cited by:0 (Source: Crossref)

    Suppose F is a subgraph of a convex complete graph Kn and F contains no boundary edge of Kn and |E(F)|n1. We determine necessary and sufficient conditions on F such that KnF admits a triangulation. For |E(F)|n, we investigate the possibility of placing F in Kn such that KnF admits a triangulation for certain families of graphs F. These results are then applied to determine the convex skewness of the convex graphs of the form KnF.

    Communicated by Liying Kang

    AMSC: 01C10
    Remember to check out the Most Cited Articles!

    Be inspired by these NEW Mathematics books for inspirations & latest information in your research area!