Achromatic numbers and graph operations

Simple item page
dc.contributor.authorHell, Pavol
dc.contributor.authorMiller, D.J.
dc.date.accessioned2009-08-20T23:06:20Z
dc.date.available2009-08-20T23:06:20Z
dc.date.copyright1988en
dc.date.issued2009-08-20T23:06:20Z
dc.description.abstractIn this paper we investigate the achromatic number of the disjoint union of graphs and the achromatic number of the categorical product of graphs. We obtain the best possible upper and lower bounds for the union of graphs and the best possible lower bound for the product of graphs. Finally we show that the achromatic number of the product of graphs is bounded above.en
dc.identifier.urihttp://hdl.handle.net/1828/1555
dc.language.isoenen
dc.relation.ispartofseriesDM-462-IRen
dc.subjecttechnical reports (mathematics and statistics)
dc.subject.departmentDepartment of Mathematics and Statistics
dc.titleAchromatic numbers and graph operationsen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
DM-462-IR.pdf
Size:
363.1 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

Faculty and Staff Publications
 
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.