Classes of intersection graphs
A circular arc graph is defined as the intersection graph of arcs on a circle. A polygon-circle graph is defined as the intersection of polygons with corners on a circle. One characterization of a chordal graph is as the intersection graph of connected subgraphs of a tree.
We characterize intersection classes. The main result is generalized for classes in which the assignment of sets to vertices must be one-to-one, as well as for ...
A graph is an intersection graph if it is possible to assign sets to its vertices so that adjacency corresponds exactly to nonempty intersection.
People also ask
What are the different types of intersection graphs?
What is the intersection subgroup graph of a group?
Theintersection class defined by a set of sets ∑ is the set of all graphs having an intersection representation using sets from ∑. Interval graphs and chordal ...
Our principal results include: (1) A readily applicable characterization of those classes of graphs of the form (OMEGA)(S). (2) Testing G(ELEM)(OMEGA)(S) can ...
PDF | Starlike graphs are the intersection graphs of substars of a star. We describe different characterizations of starlike graphs, including one by.
Jul 25, 2019 · Seker et al. exploited this characterisation of chordal graphs to obtain an algorithm for generating them. In this paper, we propose an ...
A characterization of containment classes of graphs is presented as well as characterizations for overlap and disjointedness classes. These results are compared ...
[12] T.B. Moorhouse, Characterizing hereditary graph classes as the intersection graphs of subgraphs of graphs, submitted for publication. [13] T.B. ...
A Finite Characterization and Recognition of Intersection Graphs of Hypergraphs with Rank at Most 3 and Multiplicity at Most 2 in the Class of Threshold Graphs.