Map graphs in polynomial time

DOI10.1109/SFCS.1998.743490MaRDI QIDQ6909481zbMATH OpenFDO

Authors Mikkel Thorup

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1109/SFCS.1998.743490

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(2)

• Twin-width of planar graphs is at most 8, and some related bounds
• Decomposition of map graphs with applications

This page was built for publication: Map graphs in polynomial time

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