'Simple planar graph' presentation slideshows

Graph Colouring

Graph Colouring. Lecture 20: Nov 25. Graph Colouring. Graph Colouring Problem: Given a graph, colour all the vertices so that two adjacent vertices get different colours. Objective: use minimum number of colours. 3-colourable. Optimal Colouring.

742 views • 48 slides

15-251

483 views • 48 slides

15-251

638 views • 43 slides

15-251

433 views • 43 slides

Last time: terminology reminder w

Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual. Bipartite Planar Cycle Tree Path Circuit Components Spanning Tree. Last time: terminology reminder w. edge. vertex (node). Vertex degree is 3. Spanning Trees.

487 views • 33 slides

Computational Geometry

Computational Geometry. Chapter 11 The Crossing-Number Lemma. On the Agenda. The Crossing-Number Lemma Applications to combinatorial problems. Historical Perspective.

133 views • 13 slides