Další formáty:
BibTeX
LaTeX
RIS
@article{1075300,
author = {Hliněný, Petr and Derka, Martin and Chimani, Markus and Klusáček, Matěj},
article_location = {Holandsko},
article_number = {1},
doi = {http://dx.doi.org/10.1016/j.aam.2012.06.004},
keywords = {Projective-planar graph; Planar emulator; Planar cover; Graph minor},
language = {eng},
issn = {0196-8858},
journal = {Advances in Applied Mathematics},
title = {How Not to Characterize Planar-emulable Graphs},
volume = {50},
year = {2013}
}
TY - JOUR
ID - 1075300
AU - Hliněný, Petr - Derka, Martin - Chimani, Markus - Klusáček, Matěj
PY - 2013
TI - How Not to Characterize Planar-emulable Graphs
JF - Advances in Applied Mathematics
VL - 50
IS - 1
SP - 46-68
EP - 46-68
PB - Elsevier
SN - 01968858
KW - Projective-planar graph
KW - Planar emulator
KW - Planar cover
KW - Graph minor
N2 - We investigate the question of which graphs have planar emulators (a locally-surjective homomorphism from some finite planar graph) - a problem raised already in Fellows thesis (1985) and conceptually related to the better known planar cover conjecture by Negami (1986). For over two decades, the planar emulator problem lived poorly in a shadow of Negamis conjecture - which is still open - as the two were considered equivalent. But, at 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 of likening it to projective embeddability is actually very out-of-place. We also present several positive partial characterizations of planar-emulable graphs.
ER -
HLINĚNÝ, Petr, Martin DERKA, Markus CHIMANI a Matěj KLUSÁČEK. How Not to Characterize Planar-emulable Graphs. \textit{Advances in Applied Mathematics}. Holandsko: Elsevier, 2013, roč.~50, č.~1, s.~46-68. ISSN~0196-8858. Dostupné z: https://dx.doi.org/10.1016/j.aam.2012.06.004.
|
