Planar Emulators Conjecture Is Nearly True for Cubic Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00066368" target="_blank" >RIV/00216224:14330/13:00066368 - isvavai.cz</a>
Result on the web
<a href="http://www.eurocomb2013.it/" target="_blank" >http://www.eurocomb2013.it/</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Planar Emulators Conjecture Is Nearly True for Cubic Graphs
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
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
The Seventh European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013
ISBN
9788876424748
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
245-250
Publisher name
Scuola Normale Superiore Pisa
Place of publication
Pisa, Italy
Event location
Pisa, Italy
Event date
Sep 9, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—