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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n9http://localhost/temp/predkladatel/
n17http://linked.opendata.cz/resource/domain/vavai/projekt/
n12http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/subjekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F13%3A10145920%21RIV14-GA0-11320___/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F13%3A10145920%21RIV14-GA0-11320___
rdf:type
skos:Concept n7:Vysledek
dcterms:description
We show several results on computational complexity of finding a contraction of a graph to a path. We show several results on computational complexity of finding a contraction of a graph to a path.
dcterms:title
A note on contracting claw-free graphs A note on contracting claw-free graphs
skos:prefLabel
A note on contracting claw-free graphs A note on contracting claw-free graphs
skos:notation
RIV/00216208:11320/13:10145920!RIV14-GA0-11320___
n7:predkladatel
n8:orjk%3A11320
n4:aktivita
n11:I n11:P
n4:aktivity
I, P(GBP202/12/G061), P(LH12095)
n4:cisloPeriodika
2
n4:dodaniDat
n13:2014
n4:domaciTvurceVysledku
n12:4260686
n4:druhVysledku
n14:J
n4:duvernostUdaju
n18:S
n4:entitaPredkladatele
n15:predkladatel
n4:idSjednocenehoVysledku
58875
n4:idVysledku
RIV/00216208:11320/13:10145920
n4:jazykVysledku
n10:eng
n4:klicovaSlova
claw-free graph; contraction; computational complexity
n4:klicoveSlovo
n16:contraction n16:computational%20complexity n16:claw-free%20graph
n4:kodStatuVydavatele
FR - Francouzská republika
n4:kontrolniKodProRIV
[ECFD3D387A58]
n4:nazevZdroje
Discrete Mathematics and Theoretical Computer Science
n4:obor
n19:BA
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
3
n4:projekt
n17:GBP202%2F12%2FG061 n17:LH12095
n4:rokUplatneniVysledku
n13:2013
n4:svazekPeriodika
15
n4:tvurceVysledku
Kaminski, Marcin Fiala, Jiří Paulusma, Daniel
s:issn
1365-8050
s:numberOfPages
10
n9:organizacniJednotka
11320