A linear time algorithm for finding a maximum independent set of a fullerene
From MaRDI portal
Publication:2364862
DOI10.4310/JOC.2017.v8.n2.a2zbMath1367.05201OpenAlexW2588150890MaRDI QIDQ2364862
Sean Daugherty, Wendy J. Myrvold
Publication date: 25 July 2017
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4310/joc.2017.v8.n2.a2
Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)