Counting Hexagonal Patches and Independent Sets in Circle Graphs (Q3557053): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1524609008 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0808.3881 / rank | |||
Normal rank | |||
Latest revision as of 17:33, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting Hexagonal Patches and Independent Sets in Circle Graphs |
scientific article |
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
