User:Karoshbn/Books/MATHEMATICS XII - Graph Theory

Graph Theory

 * Graph theory
 * Graph (discrete mathematics)
 * Seven Bridges of Königsberg
 * Knight's tour
 * Graph drawing
 * Graph (abstract data type)
 * Subgraph isomorphism problem
 * Clique problem
 * Independent set (graph theory)
 * Complete bipartite graph
 * Three utilities problem
 * Graph coloring
 * Four color theorem
 * Strong perfect graph theorem
 * Erdős–Faber–Lovász conjecture
 * Total coloring
 * List edge-coloring
 * Hadwiger conjecture (graph theory)
 * Hamiltonian path problem
 * Minimum spanning tree
 * Route inspection problem
 * Shortest path problem
 * Steiner tree problem
 * Travelling salesman problem
 * Max-flow min-cut theorem
 * Art gallery problem
 * Covering problems
 * Set cover problem
 * Vertex cover
 * Arboricity
 * Cycle double cover
 * Edge coloring
 * Graph factorization
 * Forbidden graph characterization
 * Citation graph
 * Data structure
 * Disjoint-set data structure
 * Dual-phase evolution
 * Entitative graph
 * Existential graph
 * Graph algebra
 * Graph automorphism
 * Graph database
 * Graph equation
 * Graph rewriting
 * Graph sandwich problem
 * Graph property
 * Intersection graph
 * Logical graph
 * Loop (graph theory)
 * Network theory
 * Null graph
 * Pebble motion problems
 * Percolation
 * Perfect graph
 * Quantum graph
 * Random regular graph
 * Semantic network
 * Spectral graph theory
 * Strongly regular graph
 * Symmetric graph
 * Transitive reduction
 * Tree (data structure)
 * Bellman–Ford algorithm
 * Dijkstra's algorithm
 * Ford–Fulkerson algorithm
 * Kruskal's algorithm
 * Nearest neighbour algorithm
 * Prim's algorithm
 * Depth-first search
 * Breadth-first search
 * Algebraic graph theory
 * Geometric graph theory
 * Extremal graph theory
 * Random graph
 * Topological graph theory
 * Knot theory
 * Ramsey theory
 * Hypergraph
 * Abstract simplicial complex