Forbidden Induced Subgraphs for Bounded $p$-Intersection Number

Claudson F. Bornstein, Jose W. C. Pinto, Dieter Rautenbach +1

A graph $G$ has $p$-intersection number at most $d$ if it is possible to assign to every vertex $u$ of $G$, a subset $S(u)$ of some ground set $U$ with $|U|=d$ in such a way that d…