5: Graph Theory — Read — Invisible Network

From LibreTexts, under CC BY-NC-SA 4.0, as the source states it; its equations are written in TeX, which the PDF shows typeset. This page at LibreTexts.

This textmap is stilll under construction. Please forgive us.

5.1: The Basics of Graph Theory
5.2: Euler Circuits and Walks
5.3: Hamilton Cycles and Paths
5.4: Bipartite Graphs
5.5: Trees
5.6: Optimal Spanning Trees
5.7: Connectivity
We have seen examples of connected graphs and graphs that are not connected. While "not connected'' is pretty much a dead end, there is much to be said about "how connected'' a connected graph is. The simplest approach is to look at how hard it is to disconnect a graph by removing vertices or edges. We assume that all graphs are simple.
5.8: Graph Coloring
5.9: The Chromatic Polynomial
5.10: Coloring Planar Graphs
5.11: Directed Graphs
5.E: Graph Theory (Exercises)

David Guichard (Whitman College)
Thumbnail: A drawing of a graph. (Public Domain; AzaToth via Wikipedia)

This page titled 5: Graph Theory was last modified on Tue, 01 Sep 2026 03:33:57 GMT and is shared under a CC BY-NC-SA 4.0 license and was authored, remixed, and/or curated by David Guichard via source content that was edited to the style and standards of the LibreTexts platform.

Contents

Text