. . . . "Pairwise compatibility graph"@en . . "In graph theory, a graph is a pairwise compatibility graph (PCG) if there exists a tree and two non-negative real numbers such that each node of has a one-to-one mapping with a leaf node of such that two nodes and are adjacent in if and only if the distance between and are in the interval . The subclasses of PCG include graphs of at most seven vertices, cycles, forests, complete graphs, interval graphs and ladder graphs. However, there is a graph with eight vertices that is known not to be a PCG."@en . . . . . . "69628781"^^ . . . . . "In graph theory, a graph is a pairwise compatibility graph (PCG) if there exists a tree and two non-negative real numbers such that each node of has a one-to-one mapping with a leaf node of such that two nodes and are adjacent in if and only if the distance between and are in the interval . The subclasses of PCG include graphs of at most seven vertices, cycles, forests, complete graphs, interval graphs and ladder graphs. However, there is a graph with eight vertices that is known not to be a PCG."@en . . "Graph that is pairwise compatibility graphs of the trees and"@en . . . . "1104463065"^^ . "400"^^ . . "Pairwise compatibility graph.jpg"@en . . . "3763"^^ . "Graphs that are not pairwise compatibility graphs 01.jpg"@en . . . "Graphs that are not pairwise compatibility graphs"@en . . . . . "vertical"@en . .