Bipartite graphs without a skew star (Q1849995)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1838976
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bipartite graphs without a skew star |
scientific article; zbMATH DE number 1838976 |
Statements
Bipartite graphs without a skew star (English)
0 references
2 December 2002
0 references
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.
0 references
bipartite graphs
0 references
structural characterization
0 references
clique-width
0 references
0.7216998934745789
0 references
0.7216262817382812
0 references
