abstract simplicial complex adjacency list adjacency matrix algebraic graph theory algorithm array arthur cayley atom augustin louis cauchy augustus de morgan bellman-ford algorithm breadth-first search camille jordan chemical bond chemistry clique problem combinatorics complete bipartite graph complete graph computer science conceptual graph condensed matter physics data structure degree matrix depth-first search differential calculus digital object identifier disjoint-set data structure distance matrix electric current entitative graph existential graph extremal graph theory ford-fulkerson algorithm francis guthrie gallery of named graphs geometric graph theory glossary of graph theory gottfried leibniz graph graph coloring graph drawing graph rewriting graph transformation group theory gustav kirchhoff hamiltonian path problem hassler whitney hugo hadwiger hypergraph incidence matrix independent set independent set problem james joseph sylvester johann benedict listing julius petersen kazimierz kuratowski kenneth appel knot theory laplacian matrix leonhard euler list edge-coloring list of graph theory topics logical graph mathworld mathematics minimum spanning tree molecule editor nearest neighbour algorithm network analysis nicolaas govert de bruijn null graph percy john heawood perfect graph peter guthrie tait physics planar graph quantum graph ramsey theory random graph reconstruction conjecture route inspection problem sequential dynamical system set cover problem shortest path problem sociology spectral graph theory steiner tree strongly regular graph subgraph isomorphism problem topological graph theory topology total coloring vertex cover problem voltage website william rowan hamilton wolfgang haken