Choice numbers for unions of graphs

Simple item page
dc.contributor.authorFerneyhough, Sheilaen_US
dc.date.accessioned2024-08-13T22:23:06Z
dc.date.available2024-08-13T22:23:06Z
dc.date.copyright1996en_US
dc.date.issued1996
dc.degree.departmentDepartment of Mathematics and Statistics
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractThe problem of determining choice numbers for unions of graphs is investigated, with particular attention being paid to the case where one of the graphs is 2-choosable. It is shown that all 2-choosable graphs are (2k k )-choosable for all positive values of k. New results on (a b)-choosability of planar graphs, bipartite graphs and Cartesian products of graphs are also presented.
dc.format.extent53 pages
dc.identifier.urihttps://hdl.handle.net/1828/17807
dc.rightsAvailable to the World Wide Weben_US
dc.titleChoice numbers for unions of graphsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
FERNEYHOUGH_Sheila_MSc_1996_743408.pdf
Size:
11.81 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
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.