On the Power of Isolation in Planar Graphs

DOI10.1145/2003685.2003687zbMath1322.68105OpenAlexW2035439614MaRDI QIDQ2947555

Raghav Kulkarni

Publication date: 24 September 2015

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2003685.2003687

zbMATH Keywords

planar graphsperfect matchingNCNLisolating lemma

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: On the Power of Isolation in Planar Graphs