Bipartite graphs without a skew star (Q1849995)

A skew star is a tree with three vertices of degree one at distance \(1,2\) and \(3\) from the only vertex of degree \(3\). A bipartite graph \(G\) is prime if any two distinct vertices of \(G\) have different neighborhoods. The author establishes a structural characterization of prime bipartite graphs containing no skew star as an induced subgraph and proves that the clique-width of bipartite graphs without induced skew star is at most five.