Counting independent sets and maximal independent sets in some subclasses of bipartite graphs (Q1627864)
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 and maximal independent sets in some subclasses of bipartite graphs |
scientific article; zbMATH DE number 6987795
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting independent sets and maximal independent sets in some subclasses of bipartite graphs |
scientific article; zbMATH DE number 6987795 |
Statements
Counting independent sets and maximal independent sets in some subclasses of bipartite graphs (English)
0 references
3 December 2018
0 references
counting problem
0 references
independent sets
0 references
maximal independent sets
0 references
path-tree bipartite
0 references
tree convex bipartite
0 references
convex bipartite
0 references
0 references
0 references
