Counting the number of vertex covers in a trapezoid graph (Q990956)
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: Counting the number of vertex covers in a trapezoid graph |
scientific article; zbMATH DE number 5777513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting the number of vertex covers in a trapezoid graph |
scientific article; zbMATH DE number 5777513 |
Statements
Counting the number of vertex covers in a trapezoid graph (English)
0 references
1 September 2010
0 references
trapezoid graph
0 references
vertex cover
0 references
combinatorial problems
0 references
counting problems
0 references
0 references
0 references
0.8067554235458374
0 references
0.7990237474441528
0 references
0.7790756821632385
0 references
0.7561185956001282
0 references
0.7540395855903625
0 references
