Other formats:
BibTeX
LaTeX
RIS
@article{1206004,
author = {Derka, Martin and Hliněný, Petr},
article_number = {1},
doi = {http://dx.doi.org/10.1016/j.ejc.2015.02.009},
keywords = {planar emulator; projective planar graph; graph minor},
language = {eng},
issn = {0195-6698},
journal = {European Journal of Combinatorics},
title = {Planar Emulators Conjecture Is Nearly True for Cubic Graphs},
volume = {48},
year = {2015}
}
TY - JOUR
ID - 1206004
AU - Derka, Martin - Hliněný, Petr
PY - 2015
TI - Planar Emulators Conjecture Is Nearly True for Cubic Graphs
JF - European Journal of Combinatorics
VL - 48
IS - 1
SP - 63-70
EP - 63-70
PB - Elsevier
SN - 01956698
KW - planar emulator
KW - projective planar graph
KW - graph minor
N2 - We prove that a cubic nonprojective graph cannot have a finite planar emulator, unless it belongs to one of two very special cases (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 -
DERKA, Martin and Petr HLINĚNÝ. Planar Emulators Conjecture Is Nearly True for Cubic Graphs. \textit{European Journal of Combinatorics}. Elsevier, 2015, vol.~48, No~1, p.~63-70. ISSN~0195-6698. Available from: https://dx.doi.org/10.1016/j.ejc.2015.02.009.
|
