User:BrunoDeBacker/Books/GraphTheory

GraphTheory

 * Introduction
 * Graph theory
 * Graph (mathematics)
 * Vertex (graph theory)
 * Regular graph
 * Degree (graph theory)
 * Loop (graph theory)
 * Complete graph
 * Tree (graph theory)
 * Planar graph
 * Connectivity (graph theory)
 * Cycle (graph theory)
 * Graph minor
 * Complete bipartite graph
 * Bipartite graph
 * Graph coloring
 * Matching (graph theory)
 * Independent set (graph theory)
 * Cycle graph
 * Edge coloring
 * Multigraph
 * Four color theorem
 * Hamiltonian path
 * Graph drawing
 * Adjacency matrix


 * Spanning trees
 * Directed acyclic graph
 * Line graph
 * Path (graph theory)
 * Graph isomorphism
 * Perfect graph
 * Forbidden graph characterization


 * Network flows
 * Ford–Fulkerson algorithm
 * Dinic's algorithm
 * Max-flow min-cut theorem
 * Push–relabel maximum flow algorithm
 * Minimum-cost flow problem
 * Hypergraph
 * Complement graph
 * Clique (graph theory)
 * Triangle-free graph
 * Null graph
 * Strongly connected component
 * Vertex-transitive graph
 * Symmetric graph
 * Graph automorphism
 * Petersen graph
 * Strongly regular graph
 * Bridge (graph theory)
 * Spanning tree
 * Connected component (graph theory)
 * Depth-first search
 * Cubic graph
 * Edge-transitive graph
 * Vertex cover
 * König's theorem (graph theory)
 * Star (graph theory)
 * Girth (graph theory)
 * Claw-free graph
 * Intersection graph
 * Breadth-first search
 * Chordal graph
 * Path graph
 * Directed graph
 * Neighbourhood (graph theory)
 * Dense graph
 * Minimum spanning tree
 * Flow network
 * Centrality
 * Constructal law
 * Oriented matroid
 * Shortest path problem
 * Gomory–Hu tree
 * Maximum flow problem
 * Multi-commodity flow problem
 * Nowhere-zero flow
 * Out-of-kilter algorithm
 * Circulation problem
 * Betweenness centrality
 * Johnson's algorithm
 * Borůvka's algorithm
 * Steiner tree problem
 * K-minimum spanning tree
 * Euclidean minimum spanning tree
 * Rectilinear minimum spanning tree
 * Capacitated minimum spanning tree
 * Degree-constrained spanning tree
 * Arborescence (graph theory)
 * Edmonds' algorithm
 * Widest path problem
 * Prim's algorithm
 * Kruskal's algorithm
 * Bellman–Ford algorithm
 * Backtracking
 * A* search algorithm
 * Alpha–beta pruning
 * Iterative deepening depth-first search
 * Tree traversal
 * Contraction hierarchies
 * Dijkstra's algorithm


 * Glossary
 * Glossary of graph theory
 * Comparability graph
 * Trivially perfect graph
 * Permutation graph
 * Floyd–Warshall algorithm
 * Bron–Kerbosch algorithm
 * Christofides algorithm
 * Blossom algorithm
 * Jump point search
 * K shortest path routing
 * Tarjan's strongly connected components algorithm
 * Flooding algorithm
 * FKT algorithm
 * Hopcroft–Karp algorithm
 * Girvan–Newman algorithm
 * Path-based strong component algorithm
 * Dulmage–Mendelsohn decomposition
 * Fuzzy transportation