Bipartite graphs without a skew star (Q1849995): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(01)00471-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998244133 / rank | |||
Normal rank | |||
Latest revision as of 10:35, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bipartite graphs without a skew star |
scientific article |
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
