Counting Hexagonal Patches and Independent Sets in Circle Graphs
From MaRDI portal
Publication:3557053
DOI10.1007/978-3-642-12200-2_52zbMath1283.05131arXiv0808.3881OpenAlexW1524609008MaRDI 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 complexitygraph algorithmsplanar graphcounting problemfullerenecircle graphpolyhexfusenehexagonal patch
Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Counting Hexagonal Patches and Independent Sets in Circle Graphs