# Category:Topological graph theory

Computing portal |

Here is a list of articles in the Topological graph theory category of the Computing portal that unifies foundations of mathematics and computations using computers. Topological graph theory is a branch of graph theory. Its main topic is the study of embeddings of graphs in surfaces.
See also Category:Geometric graph theory and Category:Graph drawing

## Pages in category "Topological graph theory"

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

- Topological graph theory
*(computing)*

### A

- Albertson conjecture
*(computing)*

### B

- Betti number
*(computing)* - Book embedding
*(computing)*

### C

- Combinatorial map
*(computing)* - Covering space
*(computing)* - Crossing number (graph theory)
*(computing)* - Crossing number inequality
*(computing)* - Crossing Numbers of Graphs
*(computing)* - Cycle double cover
*(computing)*

### D

- Dessin d'enfant
*(computing)* - Dual graph
*(computing)*

### E

- Euler characteristic
*(computing)* - Euler's Gem
*(computing)*

### F

- Left-right planarity test
*(computing)*

### G

- Generalized map
*(computing)* - Genus (mathematics)
*(computing)* - Graph embedding
*(computing)* - Graph-encoded map
*(computing)*

### H

- Heawood conjecture
*(computing)* - Heawood number
*(computing)*

### L

- Linkless embedding
*(computing)*

### M

- Matsushima's formula
*(computing)*

### P

- Petrie dual
*(computing)*

### Q

- Queue number
*(computing)*

### R

- Regular map (graph theory)
*(computing)* - Ribbon graph
*(computing)* - Road coloring theorem
*(computing)* - Rotation system
*(computing)*

### S

- String graph
*(computing)*

### T

- Thrackle
*(computing)* - Three utilities problem
*(computing)* - Topological graph
*(computing)* - Toroidal graph
*(computing)* - Turán's brick factory problem
*(computing)*

### W

- Wilson operation
*(computing)*

### X

- Xuong tree
*(computing)*