Spanning caterpillar in biconvex bipartite graphs

Dhanyamol Antony, Anita Das, Shirish Gosavi +2

A bipartite graph $G=(A,B,E)$ is said to be a biconvex bipartite graph if there exist orderings ${<}_A$ in $A$ and ${<}_B$ in $B$ such that the neighbors of every vertex in $A$ are c…