Classifying the clique-width of \(H\)-free bipartite graphs (Q906431)
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 6534165
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classifying the clique-width of \(H\)-free bipartite graphs |
scientific article; zbMATH DE number 6534165 |
Statements
Classifying the clique-width of \(H\)-free bipartite graphs (English)
0 references
21 January 2016
0 references
clique-width
0 references
bipartite graph
0 references
graph class
0 references
0 references
0.9946401715278624
0 references
0.8200476169586182
0 references
0.8200475573539734
0 references
0.811777651309967
0 references
0.8071078658103943
0 references
