2 problems

Nevries–Rosenke's conjecture. The leaf powers are exactly the strongly chordal graphs that contain none of $H_1,\ldots,H_7$ as an induced subgraph.

An edge-clique graph is a graph obtained as the edge-clique graph $K_e(G)$ of some graph $G$, where vertices of $K_e(G)$ represent edges of $G$ and adjacency represents incident ed…