# Category:Trees (graph theory)

Here is a list of articles in the category **Trees (graph theory)** of the Computing portal that unifies foundations of mathematics and computations using computers.

## Subcategories

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

## Pages in category "Trees (graph theory)"

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

### *

- Tree (graph theory)
*(computing)*

### A

- Agreement forest
*(computing)* - Arborescence (graph theory)
*(computing)*

### B

- Bethe lattice
*(computing)* - Block graph
*(computing)* - Blossom tree (graph theory)
*(computing)* - Branch-decomposition
*(computing)*

### C

- Caterpillar tree
*(computing)* - Cayley's formula
*(computing)* - Centered tree
*(computing)*

### G

- Game tree
*(computing)*

### H

- Heavy path decomposition
*(computing)* - Hypertree
*(computing)*

### K

- K-ary tree
*(computing)* - K-tree
*(computing)* - Kruskal's tree theorem
*(computing)*

### L

- Level ancestor problem
*(computing)* - Linear forest
*(computing)* - Lowest common ancestor
*(computing)*

### M

- M-ary tree
*(computing)*

### P

- Path graph
*(computing)* - Pfafstetter Coding System
*(computing)* - Polytree
*(computing)* - Prüfer sequence
*(computing)*

### R

- Random recursive tree
*(computing)* - Random tree
*(computing)* - Rectilinear Steiner tree
*(computing)* - Recursive tree
*(computing)*

### S

- Serre's property FA
*(computing)* - Star (graph theory)
*(computing)* - Starlike tree
*(computing)* - Steiner tree problem
*(computing)* - Strahler number
*(computing)*

### T

- Tree decomposition
*(computing)*

### U

- Uniform tree
*(computing)* - Unrooted binary tree
*(computing)*

### V

- Variation (game tree)
*(software)*

### W

- Wedderburn–Etherington number
*(computing)* - Wiener connector
*(computing)*