The phylogeny number in the aspect of triangles and diamonds of a graph

Soogang Eoh, Suh-Ryung Kim, Hojun Lee

Given an acyclic digraph $D$, the competition graph of $D$, denoted by $C(D)$, is the simple graph having vertex set $V(D)$ and edge set $\{uv \mid (u, w), (v, w) \in A(D) \text{ f…