Forbidden Subgraphs of Bigraphs of Ferrers Dimension 2
A bipartite graph B with bipartion X, Y is called a Ferrers bigraph if the neighbor sets of the vertices of X (or equivalently Y) are linearly ordered by set inclusion. The Ferrers dimension of B is the minimum number of Ferrers bigraphs whose intersection is B. In this paper we present a new approach of finding the forbidden subgraphs of bigraphs of Ferrers dimension 2 when it contains a strong bisimplicial edge.
KeywordsATE Ferrers dimension Strong bisimplicial edge Forbidden subgraphs
- 1.Cogis, O.: A characterization of digraphs with Ferrers dimension 2. Rapport de Recherche, no. 19, G.R. CNRS no. 22, Paris (1979)Google Scholar