3 problems

A unit-disk graph $G$ is a graph obtained by representing vertices as points in the plane and joining two vertices whenever their Euclidean distance is at most one. Let $\omega(G)$…

Let $G$ be a unit disk graph, let $\zeta(G)$ denote its localization number, and let $\omega(G)$ denote its clique number. Unit-disk localization conjecture. There is a function…

Let $G$ be a co-bipartite unit disk graph, meaning that its vertex set can be partitioned into two cliques, and let the bipartite complement of $G$ be the graph obtained by complem…