Counting hexagonal patches and independent sets in circle graphs (Q3557053)
From MaRDI portal
!
WARNING
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 5702185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting hexagonal patches and independent sets in circle graphs |
scientific article; zbMATH DE number 5702185 |
Statements
Counting Hexagonal Patches and Independent Sets in Circle Graphs (English)
0 references
27 April 2010
0 references
graph algorithms
0 references
computational complexity
0 references
counting problem
0 references
planar graph
0 references
circle graph
0 references
fullerene
0 references
hexagonal patch
0 references
fusene
0 references
polyhex
0 references
0.9953085780143738
0 references
0.7729273438453674
0 references
0.7386684417724609
0 references
