Bithreshold Graphs
P. L. Hammer, N. V. R. Mahadev · SIAM Journal on Algebraic and Discrete Methods · 1985
A graph is called bithreshold if it is the edge-intersection of two threshold graphs $T_1 $, $T_2 $ and if every stable set of it is stable in $T_1 $, or $T_2 $. In this paper an easy recognition algorithm is proposed for this class of graphs and bithreshold graphs are proved to be strongly perfect.