On bipartite graphs with weak density of some subgraphs Original Research Article

image-sparse graphs (defined by Hoàng) and image-reducible graphs (defined by Jamison and Olariu) are graphs with weak density of imageʹs. Weak-bisplit graphs are bipartite graphs which show some analogies with cographs (i.e. image-free graphs) and are characterized with two forbidden configurations. We describe here bipartite graphs with weak density of those configurations. Structural properties and recognition algorithms are given.