Trapezoid graph
In graph theory, trapezoid graphs are intersection graphs of trapezoids between two horizontal lines.
They are a class of co-comparability graphs that contain interval graphs and permutation graphs as subclasses. A graph is a trapezoid graph if there exists a set of trapezoids corresponding to the vertices of the graph such that two vertices are joined by an edge if and only if the corresponding trapezoids intersect. Trapezoid graphs were introduced by Dagan, Golumbic, and Pinter in 1988. There exists algorithms for chromatic number, weighted independent set, clique cover, and maximum weighted clique.
Text above is from the Wikipedia article Trapezoid graph, available under CC BY-SA 4.0. View counts are human page views from Wikimedia's public statistics.