Planar induced subgraphs of sparse graphs

DOI10.1007/978-3-662-45803-7_1MaRDI QIDQ2936909zbMATH OpenOpenAlexFDO

Authors Glencora Borradaile, David Eppstein, Pingan Zhu

Publication date 7 January 2015

Published in Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-45803-7_1

zbMATH Keywords

linear-time algorithmspseudoforest

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)

Recommendations

• Planar induced subgraphs of sparse graphs
• scientific article; zbMATH DE number 2084267
• Exact algorithm for the maximum induced planar subgraph problem
• Subexponential-time algorithms for finding large induced sparse subgraphs
• Large induced forests in triangle-free planar graphs

Cited in

(8)

• Subexponential-time algorithms for finding large induced sparse subgraphs
• Bounds on half graph orders in powers of sparse graphs
• scientific article; zbMATH DE number 2084267 (Why is no real title available?)
• Exact algorithm for the maximum induced planar subgraph problem
• K₄-minor-free induced subgraphs of sparse connected graphs
• A linear-time algorithm for finding induced planar subgraphs
• Planar induced subgraphs of sparse graphs
• scientific article; zbMATH DE number 7650231 (Why is no real title available?)

This page was built for publication: Planar induced subgraphs of sparse graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936909)