User:BrunoDeBacker/Books/GraphTheory
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
GraphTheory
[edit]- 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