intersection graph
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
en-US/ˌɪntɚˈsɛkʃən ˈɡɹæf/
en-GB/ˌɪntəˈsɛkʃn ɡɹɑːf/
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