Classifying the clique-width of \(H\)-free bipartite graphs (Q2920484)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Classifying the clique-width of H-free bipartite graphs |
scientific article; zbMATH DE number 6348580
| 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 6348580 |
Statements
Classifying the Clique-Width of H-Free Bipartite Graphs (English)
0 references
26 September 2014
0 references
0.9946401715278624
0 references
0.8231512308120728
0 references
0.8231512308120728
0 references
0.8120437860488892
0 references
0.807463526725769
0 references
