Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1123096,
author = {Hliněný, Petr and Derka, Martin},
address = {Pisa, Italy},
booktitle = {The Seventh European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013},
editor = {J. Nešetřil, M. Pellegrini},
keywords = {planar cover; planar emulator; projective planar; splitter theorem},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Pisa, Italy},
isbn = {978-88-7642-474-8},
pages = {245-250},
publisher = {Scuola Normale Superiore Pisa},
title = {Planar Emulators Conjecture Is Nearly True for Cubic Graphs},
url = {http://www.eurocomb2013.it/},
year = {2013}
}
TY - JOUR
ID - 1123096
AU - Hliněný, Petr - Derka, Martin
PY - 2013
TI - Planar Emulators Conjecture Is Nearly True for Cubic Graphs
PB - Scuola Normale Superiore Pisa
CY - Pisa, Italy
SN - 9788876424748
KW - planar cover
KW - planar emulator
KW - projective planar
KW - splitter theorem
UR - http://www.eurocomb2013.it/
L2 - http://www.eurocomb2013.it/
N2 - We prove that a cubic nonprojective graph cannot have a finite planar emulator, unless one of two very special cases happen (in which the answer is open). This shows that Fellows' planar emulator conjecture, disproved for general graphs by Rieck and Yamashita in 2008, is nearly true on cubic graphs, and might very well be true there definitely.
ER -
HLINĚNÝ, Petr and Martin DERKA. Planar Emulators Conjecture Is Nearly True for Cubic Graphs. In J. Nešetřil, M. Pellegrini. \textit{The Seventh European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013}. Pisa, Italy: Scuola Normale Superiore Pisa, 2013, p.~245-250. ISBN~978-88-7642-474-8.
|
