Header menu link for other important links
Forbidden subgraphs of bigraphs of ferrers dimension 2
Published in Springer Verlag
Volume: 10398 LNCS
Pages: 38 - 49
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. © 2017, Springer International Publishing AG.
About the journal
JournalData powered by TypesetLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherData powered by TypesetSpringer Verlag
Open AccessNo