This HTML5 document contains 47 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/
n20http://linked.opendata.cz/resource/domain/vavai/projekt/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n6http://linked.opendata.cz/resource/domain/vavai/subjekt/
n5http://linked.opendata.cz/ontology/domain/vavai/
n13http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n22http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F11%3A10104595%21RIV12-MSM-11320___/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F11%3A10104595%21RIV12-MSM-11320___
rdf:type
skos:Concept n5:Vysledek
rdfs:seeAlso
http://dx.doi.org/10.1016/j.ejc.2011.03.012
dcterms:description
We introduce a new property of graphs called ''q-state Potts uniqueness and relate it to chromatic and Tutte uniqueness, and also to ''chromatic-Flow uniqueness'', recently studied by Duan. Wu and Yu. We establish for which edge-weighted graphs H homomorphism functions from multigraphs G to H are specializations of the Tutte polynomial of G, in particular answering a question of Freedman, Lovasz and Schrijver. We also determine for which edge-weighted graphs H homomorphism functions from multigraphs G to H are specializations of the ''edge elimination polynomial'' of Averbouch, Godlin and Makowsky and the ''induced subgraph polynomial'' of Tittmann, Averbouch and Makowsky. Unifying the study of these and related problems is the notion of the left and right homomorphism profiles of a graph. We introduce a new property of graphs called ''q-state Potts uniqueness and relate it to chromatic and Tutte uniqueness, and also to ''chromatic-Flow uniqueness'', recently studied by Duan. Wu and Yu. We establish for which edge-weighted graphs H homomorphism functions from multigraphs G to H are specializations of the Tutte polynomial of G, in particular answering a question of Freedman, Lovasz and Schrijver. We also determine for which edge-weighted graphs H homomorphism functions from multigraphs G to H are specializations of the ''edge elimination polynomial'' of Averbouch, Godlin and Makowsky and the ''induced subgraph polynomial'' of Tittmann, Averbouch and Makowsky. Unifying the study of these and related problems is the notion of the left and right homomorphism profiles of a graph.
dcterms:title
Distinguishing graphs by their left and right homomorphism profiles Distinguishing graphs by their left and right homomorphism profiles
skos:prefLabel
Distinguishing graphs by their left and right homomorphism profiles Distinguishing graphs by their left and right homomorphism profiles
skos:notation
RIV/00216208:11320/11:10104595!RIV12-MSM-11320___
n5:predkladatel
n6:orjk%3A11320
n3:aktivita
n7:P n7:Z
n3:aktivity
P(1M0545), Z(MSM0021620838)
n3:cisloPeriodika
7
n3:dodaniDat
n10:2012
n3:domaciTvurceVysledku
n19:1111116
n3:druhVysledku
n9:J
n3:duvernostUdaju
n12:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
194894
n3:idVysledku
RIV/00216208:11320/11:10104595
n3:jazykVysledku
n21:eng
n3:klicovaSlova
INVARIANTS; TUTTE UNIQUENESS; Potts uniqueness; homomorphism; CHROMATICALLY UNIQUE GRAPHS
n3:klicoveSlovo
n4:CHROMATICALLY%20UNIQUE%20GRAPHS n4:TUTTE%20UNIQUENESS n4:homomorphism n4:INVARIANTS n4:Potts%20uniqueness
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[51E150DAA303]
n3:nazevZdroje
European Journal of Combinatorics
n3:obor
n18:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n20:1M0545
n3:rokUplatneniVysledku
n10:2011
n3:svazekPeriodika
32
n3:tvurceVysledku
Garijo, Delia Goodall, Andrew Nešetřil, Jaroslav
n3:wos
000294580100007
n3:zamer
n13:MSM0021620838
s:issn
0195-6698
s:numberOfPages
29
n22:doi
10.1016/j.ejc.2011.03.012
n14:organizacniJednotka
11320