Planar Induced Subgraphs of Sparse Graphs

DOI10.7155/jgaa.00358zbMath1312.05130arXiv1408.5939OpenAlexW2400876364MaRDI QIDQ5250134

David Eppstein, Pingan Zhu, Glencora Borradaile

Publication date: 18 May 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.5939

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes ⋮ The Effect of Planarization on Width ⋮ The Parameterized Complexity of Finding Point Sets with Hereditary Properties ⋮ The Effect of Planarization on Width ⋮ $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs

This page was built for publication: Planar Induced Subgraphs of Sparse Graphs