graph theory
my notes on graph theory are very messy (for now)..
 Bela Bollobas - Modern Graph Theory-Springer (2002).png)
Modern Graph Theory
Bela Bollobas
2002
Graph Theory
Reinhard Diestel
2017
nodes
- graph, subgraph, edge, vertex
- path, minimal path, cut
- bfs and dfs
- edge-induced subgraph, vertex-induced subgraph
- minimum spanning tree
- dijkstra's algorithm
- bellman-ford algorithm
- floyd-warshall algorithm
- prim's algorithm
- kruskal's algorithm
- ford–fulkerson algorithm
- edmonds-karp algorithm
- graph embedding, edge-centric graph, edge contraction, graph separator, graph cycle, mssp, sssp, planar graphs course homework 1, planar graphs course homework 2, planar graphs course homework 3, planar graphs course homework 4, decomposition tree, connected-components tree, totally monotone matrix
books
Modern Graph Theory
Bela Bollobas
2002
Graph Theory
Reinhard Diestel
2017