Title of article
Bipartite graphs without a skew star Original Research Article
Author/Authors
Vadim V. Lozin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
18
From page
83
To page
100
Abstract
A skew star is a tree with exactly three vertices of degree one being at distance 1, 2, 3 from the only vertex of degree three. In the present paper, we propose a structural characterization for the class of bipartite graphs containing no skew star as an induced subgraph and discuss some applications of the obtained result.
Keywords
Bipartite graphs , Structural characterization , Polynomial algorithm
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
949325
Link To Document