This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n11http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://purl.org/net/nknouf/ns/bibtex#
n14http://localhost/temp/predkladatel/
n13http://linked.opendata.cz/resource/domain/vavai/projekt/
n6http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n22http://linked.opendata.cz/resource/domain/vavai/subjekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
n12https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F13%3A00066368%21RIV14-MSM-14330___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n23http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F13%3A00066368%21RIV14-MSM-14330___
rdf:type
skos:Concept n15:Vysledek
rdfs:seeAlso
http://www.eurocomb2013.it/
dcterms: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. 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.
dcterms:title
Planar Emulators Conjecture Is Nearly True for Cubic Graphs Planar Emulators Conjecture Is Nearly True for Cubic Graphs
skos:prefLabel
Planar Emulators Conjecture Is Nearly True for Cubic Graphs Planar Emulators Conjecture Is Nearly True for Cubic Graphs
skos:notation
RIV/00216224:14330/13:00066368!RIV14-MSM-14330___
n15:predkladatel
n22:orjk%3A14330
n5:aktivita
n16:S n16:P
n5:aktivity
P(GBP202/12/G061), S
n5:dodaniDat
n8:2014
n5:domaciTvurceVysledku
n6:2258668 n6:7595646
n5:druhVysledku
n9:D
n5:duvernostUdaju
n20:S
n5:entitaPredkladatele
n19:predkladatel
n5:idSjednocenehoVysledku
96346
n5:idVysledku
RIV/00216224:14330/13:00066368
n5:jazykVysledku
n23:eng
n5:klicovaSlova
planar cover; planar emulator; projective planar; splitter theorem
n5:klicoveSlovo
n18:planar%20emulator n18:splitter%20theorem n18:projective%20planar n18:planar%20cover
n5:kontrolniKodProRIV
[9FD014CE0BF4]
n5:mistoKonaniAkce
Pisa, Italy
n5:mistoVydani
Pisa, Italy
n5:nazevZdroje
The Seventh European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013
n5:obor
n21:BA
n5:pocetDomacichTvurcuVysledku
2
n5:pocetTvurcuVysledku
2
n5:projekt
n13:GBP202%2F12%2FG061
n5:rokUplatneniVysledku
n8:2013
n5:tvurceVysledku
Hliněný, Petr Derka, Martin
n5:typAkce
n11:WRD
n5:zahajeniAkce
2013-09-09+02:00
s:numberOfPages
6
n17:hasPublisher
Scuola Normale Superiore Pisa
n12:isbn
9788876424748
n14:organizacniJednotka
14330