Currently displaying 1 – 4 of 4

Showing per page

Order by Relevance | Title | Year of publication

An attractive class of bipartite graphs

Rodica BoliacVadim Lozin — 2001

Discussiones Mathematicae Graph Theory

In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.

Page 1

Download Results (CSV)