On multiplicative graphs and the product conjecture

Show simple item record

dc.contributor.author Haggkvist, Roland
dc.contributor.author Hell, Pavol
dc.contributor.author Miller, Donald J.
dc.contributor.author Neumann Lara, Victor
dc.date.accessioned 2009-08-25T18:46:59Z
dc.date.available 2009-08-25T18:46:59Z
dc.date.copyright 1985 en
dc.date.issued 2009-08-25T18:46:59Z
dc.identifier.uri http://hdl.handle.net/1828/1589
dc.description.abstract We characterize those directed and undirected paths P and cycles C which have the property that the class of graphs not admitting a homomorphism into P, respectively C, is closed under taking the product (conjunction). Whether all undirected complete graphs have the property is a longstanding open question due to S. Hedetniemi. en
dc.language.iso en en
dc.relation.ispartofseries DM-391-IR en
dc.title On multiplicative graphs and the product conjecture en
dc.type Technical Report en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UVicSpace


My Account