How not to characterize planar-emulable graphs

DOI10.1016/J.AAM.2012.06.004zbMATH Open1256.05055OpenAlexW2049547185MaRDI QIDQ1931406FDOQ1931406

Martin Derka, Matěj Klusáček, Petr Hliněný, Markus Chimani

Publication date: 14 January 2013

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2012.06.004

zbMATH Keywords

graph minorprojective-planar graphplanar coverplanar emulator

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)

Cited In (4)

• Almost-linear ε -emulators for planar graphs
• Planar emulators conjecture is nearly true for cubic graphs
• The genus of regular languages and directed graph emulators
• On the planar split thickness of graphs

This page was built for publication: How not to characterize planar-emulable graphs

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