Intersection classes of graphs

graph that can be embedded in the plane

concept in graph theory

graph in which all cycles of four or more vertices have a chord

intersection graph of a collection of intervals of the real line

non-oriented graph in which two nodes are linked if and only if the two parts of a common space and represented by these nodes have a non-empty intersection in that space

graph which partitions into a clique and independent set

graph whose vertices represent the elements of a permutation

intersection graph of unit disks in the plane

connected graph whose biconnected components are all cliques

a type of node-link graph in which vertices represent chords of a circle and edges represent crossings

graph whose induced subgraphs preserve distance