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
n4http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F03%3A00002056%21RIV%2F2004%2FMSM%2F113204%2FN/
dctermshttp://purl.org/dc/terms/
n12http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/projekt/
n6http://linked.opendata.cz/ontology/domain/vavai/
n18http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://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#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F03%3A00002056%21RIV%2F2004%2FMSM%2F113204%2FN
rdf:type
n6:Vysledek skos:Concept
dcterms:description
The edge precoloring extension problem on bipartite graphs was shown to be NP-complete The edge precoloring extension problem on bipartite graphs was shown to be NP-complete
dcterms:title
NP-completeness of the edge precoloring extension problem on bipartite graphs NP-completeness of the edge precoloring extension problem on bipartite graphs
skos:prefLabel
NP-completeness of the edge precoloring extension problem on bipartite graphs NP-completeness of the edge precoloring extension problem on bipartite graphs
skos:notation
RIV/00216208:11320/03:00002056!RIV/2004/MSM/113204/N
n3:strany
156;160
n3:aktivita
n13:Z n13:P
n3:aktivity
P(LN00A056), Z(MSM 113200005)
n3:cisloPeriodika
43
n3:dodaniDat
n5:2004
n3:domaciTvurceVysledku
n19:4260686
n3:druhVysledku
n7:J
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n4:predkladatel
n3:idSjednocenehoVysledku
618491
n3:idVysledku
RIV/00216208:11320/03:00002056
n3:jazykVysledku
n17:eng
n3:klicovaSlova
NP-completeness;precoloring;extension;problem;bipartite;graphs
n3:klicoveSlovo
n10:bipartite n10:problem n10:graphs n10:NP-completeness n10:extension n10:precoloring
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[400EB0685DEA]
n3:nazevZdroje
Journal of Graph Theory
n3:obor
n15:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n8:LN00A056
n3:rokUplatneniVysledku
n5:2003
n3:svazekPeriodika
43
n3:tvurceVysledku
Fiala, Jiří
n3:zamer
n18:MSM%20113200005
s:issn
0364-9024
s:numberOfPages
5
n12:organizacniJednotka
11320