Código QR (código de barras bidimensional)

On the connectivity of the disjointness graph of segments of point sets in general position in the plane

Let $P$ be a set of $n\geq 3$ points in general position in the plane. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in $D(P)$ if and only if they are disjoint. We show that the connect...

Fuld beskrivelse

Na minha lista:
Bibliografiske detaljer
Principais autores: J. Leaños, Christophe Ndjatchi, L. M. Ríos-Castro
Format: Artigo
Sprog:Inglês
Udgivet: Discrete Mathematics & Theoretical Computer Science 2022-05-01
Serier:Discrete Mathematics & Theoretical Computer Science
Fag:
Online adgang:https://dmtcs.episciences.org/6678/pdf
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!