This HTML5 document contains 44 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/
n18http://localhost/temp/predkladatel/
n17http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/resource/domain/vavai/subjekt/
n14http://linked.opendata.cz/ontology/domain/vavai/
n19http://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/
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F11%3A10105117%21RIV12-GA0-11320___/
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/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F11%3A10105117%21RIV12-GA0-11320___
rdf:type
skos:Concept n14:Vysledek
dcterms:description
For each digraph with at most 5 vertices, we provide a list of its polymorphisms interesting with respect to the complexity of the corresponding Constraint Satisfaction Problem. We find a digraph on six vertices such that the complexity of its retraction problem is unknown with current techniques; this is the smallest such example. For each digraph with at most 5 vertices, we provide a list of its polymorphisms interesting with respect to the complexity of the corresponding Constraint Satisfaction Problem. We find a digraph on six vertices such that the complexity of its retraction problem is unknown with current techniques; this is the smallest such example.
dcterms:title
Polymorphisms of small digraphs Polymorphisms of small digraphs
skos:prefLabel
Polymorphisms of small digraphs Polymorphisms of small digraphs
skos:notation
RIV/00216208:11320/11:10105117!RIV12-GA0-11320___
n14:predkladatel
n15:orjk%3A11320
n3:aktivita
n13:P n13:Z
n3:aktivity
P(GP201/08/P056), P(GP201/09/P223), P(MEB040915), Z(MSM0021620839)
n3:cisloPeriodika
40/2
n3:dodaniDat
n6:2012
n3:domaciTvurceVysledku
n4:9494448 n4:6798268
n3:druhVysledku
n7:J
n3:duvernostUdaju
n16:S
n3:entitaPredkladatele
n8:predkladatel
n3:idSjednocenehoVysledku
221259
n3:idVysledku
RIV/00216208:11320/11:10105117
n3:jazykVysledku
n9:eng
n3:klicovaSlova
diagraphs; small; Polymorphisms
n3:klicoveSlovo
n10:diagraphs n10:small n10:Polymorphisms
n3:kodStatuVydavatele
RS - Srbská republika
n3:kontrolniKodProRIV
[95960CFE816B]
n3:nazevZdroje
Novi Sad journal of mathematics
n3:obor
n20:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n17:GP201%2F08%2FP056 n17:MEB040915 n17:GP201%2F09%2FP223
n3:rokUplatneniVysledku
n6:2011
n3:svazekPeriodika
2010
n3:tvurceVysledku
Stanovský, David Barto, Libor
n3:zamer
n19:MSM0021620839
s:issn
0352-0900
s:numberOfPages
15
n18:organizacniJednotka
11320