Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness”

Garijo Royo, Delia; Goodall, Andrew; Nesetril, Jaroslav

doi:10.1016/j.endm.2009.07.038

Artículo

dc.creator	Garijo Royo, Delia	es
dc.creator	Goodall, Andrew	es
dc.creator	Nesetril, Jaroslav	es
dc.date.accessioned	2020-03-12T10:06:39Z
dc.date.available	2020-03-12T10:06:39Z
dc.date.issued	2009
dc.identifier.citation	Garijo Royo, D., Goodall, A. y Nesetril, J. (2009). Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness”. Electronic Notes in Discrete Mathematics, 34 (august 2009), 231-236.
dc.identifier.issn	1571-0653	es
dc.identifier.uri	https://hdl.handle.net/11441/94133
dc.description.abstract	We establish for which weighted graphs H homomorphism functions from multigraphs G to H are specializations of the Tutte polynomial of G, answering a question of Freedman, Lov´asz and Schrijver. 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.	es
dc.description.sponsorship	Ministerio de Educación y Ciencia MTM2005-08441-C02-01	es
dc.format	application/pdf	es
dc.format.extent	6	es
dc.language.iso	eng	es
dc.publisher	Elsevier	es
dc.relation.ispartof	Electronic Notes in Discrete Mathematics, 34 (august 2009), 231-236.
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.subject	Tutte polynomial	es
dc.subject	Chromatic polynomial	es
dc.subject	Flow polynomial	es
dc.subject	q-state Potts partition function	es
dc.subject	Graph homomorphism	es
dc.subject	Homomorphism profile	es
dc.title	Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness”	es
dc.type	info:eu-repo/semantics/article	es
dcterms.identifier	https://ror.org/03yxnpp24
dc.type.version	info:eu-repo/semantics/submittedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
dc.contributor.affiliation	Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos	es
dc.relation.projectID	MTM2005-08441-C02-01	es
dc.relation.publisherversion	https://www.sciencedirect.com/science/article/pii/S1571065309000791	es
dc.identifier.doi	10.1016/j.endm.2009.07.038	es
dc.journaltitle	Electronic Notes in Discrete Mathematics	es
dc.publication.volumen	34	es
dc.publication.issue	august 2009	es
dc.publication.initialPage	231	es
dc.publication.endPage	236	es
dc.contributor.funder	Ministerio de Educación y Cultura (MEC). España	es

Ficheros	Tamaño	Formato	Ver	Descripción
Graph homomorphisms.pdf	134.6Kb	[PDF]	Ver/Abrir

Este registro aparece en las siguientes colecciones

Artículos (Lenguajes y Sistemas Informáticos)

Mostrar el registro sencillo del ítem

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional