About: How Not to Characterize Planar-emulable Graphs

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: How Not to Characterize Planar-emulable Graphs Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	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. 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. (en)
Title	How Not to Characterize Planar-emulable Graphs How Not to Characterize Planar-emulable Graphs (en)
skos:prefLabel	How Not to Characterize Planar-emulable Graphs How Not to Characterize Planar-emulable Graphs (en)
skos:notation	RIV/00216224:14330/11:00050170!RIV12-GA0-14330___
http://linked.open...avai/predkladatel	Fakulta informatiky
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1M0545), P(GEGIG/11/E023), Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Hliněný, Petr Derka, Martin Klusáček, Matěj
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	202802
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/11:00050170
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	projective graph; planar emulator (en)
http://linked.open.../riv/klicoveSlovo	planar emulator projective graph
http://linked.open...ontrolniKodProRIV	[787B277830A9]
http://linked.open...v/mistoKonaniAkce	Victoria, Canada
http://linked.open...i/riv/mistoVydani	Německo
http://linked.open...i/riv/nazevZdroje	IWOCA 2011, Lecture Notes in Computer Science 7056
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute for Theoretical Computer Science Graph Drawings and Representations
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Chimani, Markus Hliněný, Petr Derka, Martin Klusáček, Matěj
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2011-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
number of pages	15 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-25011-8_9
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-642-25010-1
http://localhost/t...ganizacniJednotka	14330
is http://linked.open...avai/riv/vysledek of	How Not to Characterize Planar-emulable Graphs How Not to Characterize Planar-emulable Graphs

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software