# 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 40 subcategories, out of 40 total.

### A

- Arborescences (1 P)

### B

- Boundaries (Graph Theory) (empty)

### C

- Connected Graphs (1 P)

### D

### E

- Examples of Order of Graph (2 P)
- Examples of Size of Graph (3 P)
- Examples of Trees (empty)
- Extremal Graph Theory (empty)

### F

### G

### H

- Handshake Lemma (6 P)

### K

- König's Lemma (5 P)

### L

### M

### N

### O

- Ore Graphs (3 P)

### P

- Perfect Graphs (1 P)

### R

- Rooted Trees (5 P)

### S

- Spectral Graph Theory (empty)

### T

- Transitive Reductions (empty)

### U

- Utilities Problem (1 P)

### V

- Vertex Cuts (2 P)

### W

- Walks (empty)

## Pages in category "Graph Theory"

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

### C

- Cayley's Formula
- Circuit of Simple Graph has Three Edges or More
- Condition for Edge to be Bridge
- Connected Graph with only Even Vertices has no Bridge
- Connected Vertices are Connected by Path
- Cut-Vertex divides Graph into Two or More Components
- Cycle does not Contain Subcycles
- Cycle in Balanced Signed Graph