Constant Threshold Intersection Graphs of Orthodox Paths in Trees

Claudson Ferreira Bornstein, José Wilson Coura Pinto, Dieter Rautenbach +1

A graph $G$ belongs to the class $\mathrm{ORTH}[h,s,t]$ for integers $h$, $s$, and $t$ if there is a pair $(T,\mathcal{S})$, where $T$ is a tree of maximum degree at most $h$, and ${\cal…