On Finding Hajós Constructions
Loading...
Date
Author
Institution
http://id.loc.gov/authorities/names/n79058482
Degree Level
Master's
Degree
Master of Science
Department
Department of Computing Science
Supervisor / Co-Supervisor and Their Department(s)
Examining Committee Member(s) and Their Department(s)
Citation for Previous Publication
Link to Related Item
Abstract
We develop a method for searching for Hajós constructions. Our results include the discovery of new constructions for some well-known graphs, including the Grötzsch graph, Chvátal graph, and Brinkmann graph; also, we prove that the first two of these are shortest possible constructions. These are the first published constructions for these graphs.
Item Type
http://purl.org/coar/resource_type/c_46ec
Alternative
License
Other License Text / Link
This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.
Subject/Keywords
Language
en