Now showing items 1-2 of 2

    • Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable 

      Sullivan, Matthew (University of Waterloo, 2016-09-16)
      A graph G is said to be L-colourable if for a given list assignment L = {L(v)|v ∈ V (G)} there is a proper colouring c of G such that c(v) ∈ L(v) for all v in V (G). If G is L-colourable for all L with |L(v)| ≥ k for all ...
    • Simple Drawings of Kn from Rotation Systems 

      Sullivan, Matthew A. (University of Waterloo, 2021-10-06)
      A complete rotation system on n vertices is a collection of n cyclic permutations of the elements [n]\{i}, for i∈[n]. If D is a drawing of a labelled graph, then a rotation at vertex v is the cyclic ordering of the edges ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages