Buy Me a Coffee at ko-fi.com

Trivially perfect graph

graph where every connected induced subgraph has a universal vertex

Pronunciation
/ˈtrɪviəli ˈpərfɪkt ɡræf/
/ˈtrɪvɪəli ˈpəːfɪkt ɡrɑːf/