Recent content by Stephane G

  1. S

    Graduate Why does the complement of almost every tree have diameter 2?

    Explain why the diameter of almost every complement of a tree will be 2 and find all exceptions to this rule
  2. S

    Graduate Edge Colouring of Bipartite Graphs: Proving Valency Equality

    Prove by induction on the number of edges in a graph that any bipartite graph has edge colouring number equal to its maximum valency. Also, Find such an edge colouring for a bipartite 4-regular cartesian or tensor product of your choice of 2-regular graphs
See more