# Category:Graph Theory

Jump to navigation
Jump to search

This category contains results about **Graph Theory**.

Definitions specific to this category can be found in **Definitions/Graph Theory**.

**Graph theory** is the branch of mathematics concerned with the structure and properties of graphs.

As a (graph-theoretical) graph has the same conceptual definition as a relation, it follows that there is considerable overlap between the fields of graph theory and relation theory.

## Subcategories

This category has the following 74 subcategories, out of 74 total.

### A

- Adjacency (Graph Theory) (empty)

### B

- Boundaries (Graph Theory) (empty)

### C

- Complements of Graphs (empty)
- Cubic Graphs (empty)
- Cycles (Graph Theory) (2 P)

### D

- Distance (Graph Theory) (empty)

### E

- Euler Characteristic of Finite Graph (empty)
- Examples of Order of Graph (2 P)
- Examples of Trees (2 P)
- Extremal Graph Theory (empty)

### F

- Finite Graphs (1 P)
- Forests (2 P)

### G

- Genera of Surfaces (empty)

### H

- Handshake Lemma (6 P)

### I

- Incidence (Graph Theory) (empty)

### K

- Kruskal's Algorithm (3 P)
- König's Lemma (5 P)

### L

### M

- Minimal Length Paths (empty)

### N

### O

- Ore Graphs (3 P)

### P

- Perfect Graphs (1 P)
- Platonic Graphs (empty)
- Prim's Algorithm (7 P)

### R

### S

- Semi-Hamiltonian Graphs (2 P)
- Spectral Graph Theory (empty)
- Subgraphs (empty)

### T

- Transitive Reductions (empty)
- Tutte's Wheel Theorem (2 P)

### U

- Undirected Graphs (empty)
- Utilities Problem (1 P)

### V

- Vertex Cuts (2 P)

### W

## Pages in category "Graph Theory"

The following 36 pages are in this category, out of 36 total.