Finding a chain graph in a bipartite permutation graph

• Subgraph Isomorphism is studied on graph classes.
• A polynomial-time algorithm is given for an open case in the literature.
• Base graphs are bipartite permutation graphs and pattern graphs are chain graphs.

We present a polynomial-time algorithm for solving Subgraph Isomorphism where the base graphs are bipartite permutation graphs and the pattern graphs are chain graphs.