Planar Subgraphs without Low-Degree Nodes
From MaRDI portal
Publication:5199275
DOI10.1007/978-3-642-22300-6_49zbMath1342.68168OpenAlexW1844546726MaRDI QIDQ5199275
Jukka Suomela, Oscar Morales-Ponce, Evangelos Kranakis
Publication date: 12 August 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_49
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
This page was built for publication: Planar Subgraphs without Low-Degree Nodes
