DC FieldValueLanguage
dc.contributor.authorStošić, Markoen
dc.date.accessioned2020-05-02T12:08:04Z-
dc.date.available2020-05-02T12:08:04Z-
dc.date.issued2008-01-01en
dc.identifier.issn0218-2165en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2315-
dc.description.abstractFor each graph and each positive integer n, we define a chain complex whose graded Euler characteristic is equal to an appropriate n-specialization of the dichromatic polynomial. This also gives a categorification of n-specializations of the Tutte polynomial of graphs. Also, for each graph and integer n ≤ 2, we define the different one-variable n-specializations of the dichromatic polynomial, and for each polynomial, we define graded chain complex whose graded Euler characteristic is equal to that polynomial. Furthermore, we explicitly categorify the specialization of the Tutte polynomial for graphs which corresponds to the Jones polynomial of the appropriate alternating link.en
dc.publisherWorld Scientific-
dc.relationFCT, Grants no. SFRH/BD/6783/2001 and POCI/MAT/60352/2004-
dc.relation.ispartofJournal of Knot Theory and its Ramificationsen
dc.subjectCategorification | Chromatic polynomial | Graph | Jones polynomial | Khovanoven
dc.titleCategorification of the dichromatic polynomial for graphsen
dc.typeArticleen
dc.identifier.doi10.1142/S0218216508005975en
dc.identifier.scopus2-s2.0-44249100671en
dc.relation.firstpage31en
dc.relation.lastpage45en
dc.relation.issue1en
dc.relation.volume17en
dc.description.rankM22-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0002-4464-396X-
Show simple item record

SCOPUSTM   
Citations

6
checked on May 7, 2024

Page view(s)

39
checked on May 8, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.