A twin-free graph is a graph containing no pair of twin vertices. Equivalently, every equivalence class under equality together with twinhood is a singleton set.
The definition excludes both true twins and false twins. Every induced subgraph of a cograph with at least two vertices contains twins, so the only nonempty twin-free cograph is the one-vertex graph.
