• 1 download

On Finding Hajós Constructions

  • Author / Creator
    Johnson, Erik E
  • 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.

  • Subjects / Keywords
  • Graduation date
  • Type of Item
  • Degree
    Master of Science
  • DOI
  • License
    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.
  • Language
  • Institution
    University of Alberta
  • Degree level
  • Department
    • Department of Computing Science
  • Supervisor / co-supervisor and their department(s)
    • Culberson, Joseph (Computing Science)
    • Hayward, Ryan (Computing Science)
  • Examining committee members and their departments
    • Friggstad, Zachary (Computing Science)
    • Hayward, Ryan (Computing Science)
    • Stewart, Lorna (Computing Science)
    • Culberson, Joseph (Computing Science)