Graph theory
ScienceWISE definitions
External resources
Subcategories
Concepts
- 3 colorability problem
- Aanderaa-Karp-Rosenberg conjecture
- Aczel's anti-foundation axiom
- AF-heap
- Algebraic connectivity
- Algorithmic version for Szemerédi regularity partition
- Alpha-beta pruning
- Alpha centrality
- Aperiodic graph
- Arborescence
- Arboricity
- A* search algorithm
- Assortative mixing
- Assortativity
- Balinski's theorem
- Belief propagation
- Bellman-Ford algorithm
- BEST theorem
- Bicircular matroid
- Biconnected component
- Biconnected graph
- Bidirectional search
- Bipartite dimension
- Bipartite double cover
- Bipartite half
- Borůvka's algorithm
- Bottleneck traveling salesman problem
- Boxicity
- Branch-decomposition
- Breadth-first search
- Bron-Kerbosch algorithm
- Brooks' theorem
- Canadian traveller problem
- Capacitated minimum spanning tree
- Cartesian product of graphs
- Cause-effect graph
- Cayley tree
- Chaitin's algorithm
- Characteristic polynomial of a graph
- Chemical graph theory
- Cheriyan-Mehlhorn/Gabow algorithm
- Chordal graph
- Christofides algorithm
- Chromatic number
- Chromatic polynomial
- Circle packing theorem
- Circuit rank
- Clique cover
- Clique number
- Clique percolation method
- Clique problem
- Clique-sum
- Clique-width
- Closure problem
- Cograph
- Colin de Verdière graph invariant
- Complement graph
- Complex network zeta function
- Conditional chromatic number
- Conditional coloring of graph
- Connected dominating set
- Continuous graph
- Contractible graph
- Contraction hierarchies
- Covering graph
- Cubic graph
- Cuthill-McKee algorithm
- Cut problems
- Cut sparsifier
- Cycle decomposition
- Cycle double cover
- Cycle rank
- De Bruijn graph
- Decision problem
- Decomposable graph
- Degree-constrained spanning tree
- Degree diameter problem
- Degree distribution
- Degree sequence
- Dense graph
- Dependency graph
- Depth-first search
- Depth-limited search
- Dijkstra's algorithm
- Dijkstra-Scholten algorithm
- Dinic's algorithm
- Directed acyclic graph
- Directed graph
- Directed pseudoforest
- Disjoint paths problem
- Disjoint union of graphs
- Dissociation number
- Distributed minimum spanning tree
- Domatic number
- Dominating set
- Domination number
- Dual graph
- Dulmage-Mendelsohn decomposition
- Edge chromatic number
- Edge connectivity
