Computer Algorithms II Lecture Notes

6 November 2008 • Graph Basics

Euler’s original graph

the konigsberg graph

is not a graph because of the, for example, duplicate edges between the western and northern vertices. Graphs with duplicate edges are known as hypergraphs.

This page last modified on 24 January 2006.