CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
The intersection graph of the disks with diameters the sides of a convex n-gon
Authors
Clemens Huemer
Pablo Pérez Lantero
Publication date
26 September 2019
Publisher
'Elsevier BV'
Doi
Cite
Abstract
© 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
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
UPCommons. Portal del coneixement obert de la UPC
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:upcommons.upc.edu:2117/176...
Last time updated on 30/03/2020
UPCommons
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:upcommons.upc.edu:2117/176...
Last time updated on 17/04/2020