Infoscience

Journal article

String graphs and incomparability graphs

Given a collection C of curves in the plane, its string graph is defined as the graph with vertex set C, in which two curves in C are adjacent if and only if they intersect. Given a partially ordered set (P, <), its incomparability graph is the graph with vertex set P, in which two elements of P are adjacent if and only if they are incomparable.

Fulltext

Related material