Counting Hexagonal Patches and Independent Sets in Circle Graphs
From MaRDI portal
Publication:3557053
DOI10.1007/978-3-642-12200-2_52zbMath1283.05131arXiv0808.3881MaRDI QIDQ3557053
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.3881
computational complexity; graph algorithms; planar graph; counting problem; fullerene; circle graph; polyhex; fusene; hexagonal patch
68Q25: Analysis of algorithms and problem complexity
05C30: Enumeration in graph theory
05C85: Graph algorithms (graph-theoretic aspects)