How Not to Characterize Planar-Emulable Graphs

DOI10.1007/978-3-642-25011-8_9zbMath1314.05046arXiv1107.0176OpenAlexW2556466771MaRDI QIDQ3111644

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

Publication date: 13 January 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: How Not to Characterize Planar-Emulable Graphs