List of graph theory topics
From Wikipedia, the free encyclopedia
This is a list of graph theory topics, by Wikipedia page.
See glossary of graph theory for basic terminology
Contents |
[edit] Examples and types of graphs
See also Trees
- Bipartite graph
- Bivariegated graph
- Cayley graph
- Circle graph
- Complement graph
- Complete graph
- Cubic graph
- De Bruijn graph
- Dense graph
- Dipole graph
- Directed graph
- Directed acyclic graph
- Interval graph
- Line graph
- Minor graph
- Petersen graph
- Planar graph
- Random graph
- Regular graph
- Scale-free network
- Sparse graph
- String graph
- Total graph
- Trellis (graph)
- Turán graph
- Edge-transitive graph
- Ultrahomogeneous graph
- Vertex-transitive graph
- Visibility graph
- Wheel graph
[edit] Graph coloring
- Acyclic coloring
- Chromatic polynomial
- Cocoloring
- Complete coloring
- Edge coloring
- Exact coloring
- Four color theorem
- Fractional coloring
- Graph two-coloring
- Harmonious coloring
- List coloring
- List edge-coloring
- Perfect graph
- Ramsey's theorem
- Sperner's lemma
- Strong coloring
- Subcoloring
- Tait's conjecture
- Total coloring
- Uniquely colorable graph
[edit] Paths and cycles
- Path (graph theory)
- Seven Bridges of Königsberg
- Three-cottage problem
- Shortest path problem
- Flooding algorithm
- Route inspection problem
- Hamiltonian path
- Traveling salesman problem
- Path analysis
[edit] Trees
- Tree
- Abstract syntax tree
- B-tree
- Binary tree
- B*-tree
- Heap
- Kd-tree
- Cover tree
- Decision tree
- Empty tree
- Evolutionary tree
- Exponential tree
- Family tree
- Fault tree
- Free tree
- Game tree
- K-ary tree
- Octree
- Parse tree
- Phylogenetic tree
- Polytree
- Positional tree
- PQ tree
- R-tree
- Rooted tree
- SPQR tree
- Suffix tree
- Technology tree
- Trie
- Spanning tree
- Steiner tree
- Quadtree
- Terminology
- Operations
- Other
- Tree structure
- Tree data structure
- Cayley's formula
- König's lemma
- MUD trees
- Tree (set theory) (need not be a tree in the graph-theory sense, because there may not be a unique path between two vertices)
- Tree (descriptive set theory)
- Euler tour technique
[edit] Graphs in logic
[edit] Mazes and labyrinths
[edit] Algorithms
- Flood fill
- Graph exploration algorithm
- Ant colony algorithm
- Max flow min cut theorem
- Breadth-first search
- Depth-first search
- Depth-limited search
- FKT algorithm
- Shortest path
- Topological sorting
- Maximum-cardinality search
[edit] Other topics
- Adjacency list
- Adjacency matrix
- Adjacency algebra – the algebra of polynomials in the adjacency matrix
- Canadian traveller problem
- Cliques and independent sets
- Connected component
- Cycle space
- de Bruijn sequences
- Degree diameter problem
- Entanglement (graph measure)
- Erdős–Gyárfás conjecture
- Extremal graph theory
- Frequency partition
- Frucht's theorem
- Girth
- Graph drawing
- Graph homomorphism
- Graph labeling
- Graph partition
- Graph pebbling
- Graph property
- Graph reduction
- Graph-structured stack
- Graphical model
- Tree decomposition (Junction tree) and treewidth
- Graph triangulation (see also Chordal graph)
- Perfect order
- Hidden Markov model
- Incidence matrix
- Independent set problem
- Knowledge representation
- Level structure
- Link popularity
- MacLane's planarity criterion
- Reconstruction conjecture
- Scientific classification
- Turán number
- Shannon switching game
- Snark (graph theory)
- Spectral graph theory
- Spring based algorithm
- Strongly connected component
- Vertex cover problem
[edit] Networks, network theory
See list of network theory topics
