How Not to Characterize Planar-emulable Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00050170" target="_blank" >RIV/00216224:14330/11:00050170 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-25011-8_9" target="_blank" >http://dx.doi.org/10.1007/978-3-642-25011-8_9</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-25011-8_9" target="_blank" >10.1007/978-3-642-25011-8_9</a>
Alternative languages
Result language
angličtina
Original language name
How Not to Characterize Planar-emulable Graphs
Original language description
We investigate the question of which graphs have {em planar emulators} (a locally-surjective homomorphism from some finite planar graph)---% a problem raised in Fellows' thesis (1985) and conceptually related to the better known planar cover conjectureby Negami (1986). For over two decades, the planar emulator problem lived poorly in a shadow of Negami's conjecture---which is still open---as the two were considered equivalent. But, in the end of 2008, a surprising construction by Rieck and Yamashita falsified the natural ``planar emulator conjecture'', and thus opened a whole new research field. We present further results and constructions which show how far the planar-emulability concept is from planar-coverability, and that the traditional idea oflikening it to projective embeddability is actually very out-of-place. We also present several positive partial characterizations of planar-emulable graphs.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
IWOCA 2011, Lecture Notes in Computer Science 7056
ISBN
978-3-642-25010-1
ISSN
—
e-ISSN
—
Number of pages
15
Pages from-to
106-120
Publisher name
Springer Verlag
Place of publication
Německo
Event location
Victoria, Canada
Event date
Jan 1, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—