**Gallery of graphs and algorithms **

K(4) | K(5) | K(6) | K(7) |

C(4) | C(10) | K(3,3) | K(4,2) |

W(5) |
W(6) |
The Peterson graph | The Grötzsch graph |

The Heawood graph | A three-regular graph | The graph of the dodecahedron |

The Herschel graph | A 3-regular graph with diameter of 3 |

The Grinberg graph | The Tutte graph |

A network modeling Planning a Dance

A network modeling making a spaghetti dinner

**Algorithms** (Click to load into the Stepper^{TM}. Please be patient while algorithms load.)

Build-up algorithm for spanning trees

Takeout algorithm for spanning trees

Random-choice algorithm for spanning trees

Euler circuit algorithm for Eulerian graphs

Finding bridges by connectedness

CPM for finding a critical path in a network

Listing permutations with repetition