About: Distinguishing graphs by their left and right homomorphism profiles     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
rdfs:seeAlso
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. (en)
Title
  • Distinguishing graphs by their left and right homomorphism profiles
  • Distinguishing graphs by their left and right homomorphism profiles (en)
skos:prefLabel
  • Distinguishing graphs by their left and right homomorphism profiles
  • Distinguishing graphs by their left and right homomorphism profiles (en)
skos:notation
  • RIV/00216208:11320/11:10104595!RIV12-MSM-11320___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika
  • 7
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 194894
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/11:10104595
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • INVARIANTS; TUTTE UNIQUENESS; Potts uniqueness; homomorphism; CHROMATICALLY UNIQUE GRAPHS (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [51E150DAA303]
http://linked.open...i/riv/nazevZdroje
  • European Journal of Combinatorics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 32
http://linked.open...iv/tvurceVysledku
  • Garijo, Delia
  • Goodall, Andrew
  • Nešetřil, Jaroslav
http://linked.open...ain/vavai/riv/wos
  • 000294580100007
http://linked.open...n/vavai/riv/zamer
issn
  • 0195-6698
number of pages
http://bibframe.org/vocab/doi
  • 10.1016/j.ejc.2011.03.012
http://localhost/t...ganizacniJednotka
  • 11320
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 24 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software