Some classes of graphs that are not PCGs

Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti +1

A graph $G=(V,E)$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$, $d_{min} \leq d_{max}…