A **cograph** is a type of graph that can be defined as a graph without any induced subgraphs that are isomorphic to a path of four vertices (also known as a **P4**). In simpler terms, cographs can be constructed using two operations: the **disjoint union** and the **join** (or clique-sum) of two graphs.
Articles by others on the same topic
There are currently no matching articles.