On multiplicative graphs and the product conjecture

Simple item page
dc.contributor.authorHaggkvist, Roland
dc.contributor.authorHell, Pavol
dc.contributor.authorMiller, Donald J.
dc.contributor.authorNeumann Lara, Victor
dc.date.accessioned2009-08-25T18:46:59Z
dc.date.available2009-08-25T18:46:59Z
dc.date.copyright1985en
dc.date.issued2009-08-25T18:46:59Z
dc.description.abstractWe 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.identifier.urihttp://hdl.handle.net/1828/1589
dc.language.isoenen
dc.relation.ispartofseriesDM-391-IRen
dc.titleOn multiplicative graphs and the product conjectureen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
391.pdf
Size:
837.46 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.84 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Technical Reports (Mathematics and Statistics)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.