Counting independent sets in tree convex bipartite graphs (Q730492)
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 independent sets in tree convex bipartite graphs |
scientific article; zbMATH DE number 6668741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting independent sets in tree convex bipartite graphs |
scientific article; zbMATH DE number 6668741 |
Statements
Counting independent sets in tree convex bipartite graphs (English)
0 references
28 December 2016
0 references
tree convex bipartite graphs
0 references
independent sets
0 references
maximal independent sets
0 references
independent perfect dominating sets
0 references
counting problem
0 references
0 references
0.8876417875289917
0 references
0.8537184596061707
0 references
0.8423457145690918
0 references
0.8415297269821167
0 references
0.8083949685096741
0 references
