This HTML5 document contains 38 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/
n14http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/projekt/
n3http://linked.opendata.cz/ontology/domain/vavai/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F10%3A10033302%21RIV11-MSM-11320___/
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#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F10%3A10033302%21RIV11-MSM-11320___
rdf:type
n3:Vysledek skos:Concept
dcterms:description
Let hom (G, H) be the number of homomorphisms from a graph G to a graph H. A well-known result of Lovász states that the function hom (?, H) from all graphs uniquely determines the graph H up to isomorphism. We study this function restricted to smaller classes of graphs. We show that several natural classes (2-degenerate graphs and graphs homomorphic to an arbitrary non-bipartite graph) are sufficient to recognize all graphs, and provide a description of graph properties that are recognizable by graphs with bounded tree-width. Let hom (G, H) be the number of homomorphisms from a graph G to a graph H. A well-known result of Lovász states that the function hom (?, H) from all graphs uniquely determines the graph H up to isomorphism. We study this function restricted to smaller classes of graphs. We show that several natural classes (2-degenerate graphs and graphs homomorphic to an arbitrary non-bipartite graph) are sufficient to recognize all graphs, and provide a description of graph properties that are recognizable by graphs with bounded tree-width.
dcterms:title
On recognizing graphs by numbers of homomorphisms On recognizing graphs by numbers of homomorphisms
skos:prefLabel
On recognizing graphs by numbers of homomorphisms On recognizing graphs by numbers of homomorphisms
skos:notation
RIV/00216208:11320/10:10033302!RIV11-MSM-11320___
n4:aktivita
n18:P
n4:aktivity
P(1M0545)
n4:cisloPeriodika
4
n4:dodaniDat
n5:2011
n4:domaciTvurceVysledku
n16:7445083
n4:druhVysledku
n15:J
n4:duvernostUdaju
n11:S
n4:entitaPredkladatele
n13:predkladatel
n4:idSjednocenehoVysledku
276780
n4:idVysledku
RIV/00216208:11320/10:10033302
n4:jazykVysledku
n12:eng
n4:klicovaSlova
number of homomorphisms; graph reconstruction; graph homomorphisms
n4:klicoveSlovo
n17:graph%20homomorphisms n17:graph%20reconstruction n17:number%20of%20homomorphisms
n4:kodStatuVydavatele
US - Spojené státy americké
n4:kontrolniKodProRIV
[94531EE937EB]
n4:nazevZdroje
Journal of Graph Theory
n4:obor
n7:BA
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:projekt
n8:1M0545
n4:rokUplatneniVysledku
n5:2010
n4:svazekPeriodika
64
n4:tvurceVysledku
Dvořák, Zdeněk
n4:wos
000279945500006
s:issn
0364-9024
s:numberOfPages
13
n14:organizacniJednotka
11320