Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{959107, author = {Hliněný, Petr and Derka, Martin and Chimani, Markus and Klusáček, Matěj}, address = {Německo}, booktitle = {COMBINATORIAL ALGORITHMS, Lecture Notes in Computer Science 7056}, doi = {http://dx.doi.org/10.1007/978-3-642-25011-8_9}, editor = {Costas S. Iliopoulos and William F. Smyth}, keywords = {projective graph; planar emulator;}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Německo}, isbn = {978-3-642-25010-1}, pages = {106-120}, publisher = {Springer Verlag}, title = {How Not to Characterize Planar-emulable Graphs}, year = {2011} }
TY - JOUR ID - 959107 AU - Hliněný, Petr - Derka, Martin - Chimani, Markus - Klusáček, Matěj PY - 2011 TI - How Not to Characterize Planar-emulable Graphs PB - Springer Verlag CY - Německo SN - 9783642250101 KW - projective graph KW - planar emulator; N2 - 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 conjecture by 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 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. In Costas S. Iliopoulos and William F. Smyth. \textit{COMBINATORIAL ALGORITHMS, Lecture Notes in Computer Science 7056}. Německo: Springer Verlag, 2011, s.~106-120. ISBN~978-3-642-25010-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-25011-8\_{}9.
|