The intersection graph of the disks with diameters the sides of a convex n-gon

© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/Given a convex polygon of sides, one can draw disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with vertices the disks and two disks are adjacent if and only if they have a point in common. We introduce the study of this graph by proving that it is planar for every convex polygon.Postprint (author's final draft

Informe mensual d'articles publicats. Campus Baix Llobregat. Base de dades Scopus. Setembre i octubre 2019

Informe bibliomètric mensual Campus Baix Llobregat. Base de dades Scopus. Setembre i octubre 2019. EETAC i DEAB, ESAB.Postprint (published version

The intersection graph of the disks with diameters the sides of a convex n-gon

Given a convex polygon of sides, one can draw disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with vertices the disks and two disks are adjacent if and only if they have a point in common. We introduce the study of this graph by proving that it is planar for every convex polygon