Title of article
Bisplit graphs Original Research Article
Author/Authors
Andreas Brandst?dt، نويسنده , , Peter L. Hammer، نويسنده , , Van Bang Le، نويسنده , , Vadim V. Lozin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
22
From page
11
To page
32
Abstract
An undirected graph image is a bisplit graph if its vertex set can be partitioned into a stable set and a complete bipartite graph. We provide an image time recognition algorithm for these graphs and characterize them in terms of forbidden induced subgraphs. We also discuss the problem of recognizing whether G has a stable set S such that the connected components of image are more than one complete bipartite subgraph.
Keywords
Bipartite graphs , Split graphs , Comparability graphs , Induced subgraph characterization
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948400
Link To Document