# Category:Planar graphs

Computing portal |

Here is a list of articles in the Planar graphs category of the Computing portal that unifies foundations of mathematics and computations using computers.

## Subcategories

This category has only the following subcategory.

### T

## Pages in category "Planar graphs"

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

- Planar graph
*(computing)*

### 1

- 1-planar graph
*(computing)*

### 2

- 26-fullerene graph
*(computing)*

### A

- Antiprism graph
*(computing)* - Apex graph
*(computing)* - Apollonian network
*(computing)* - Archimedean graph
*(computing)*

### B

- Baker's technique
*(computing)* - Barnette's conjecture
*(computing)* - Barnette–Bosák–Lederberg graph
*(computing)* - Bidiakis cube
*(computing)* - Blossom tree (graph theory)
*(computing)* - Book (graph theory)
*(computing)* - Bull graph
*(computing)* - Butterfly graph
*(computing)*

### C

- Cactus graph
*(engineering)* - Circle packing theorem
*(computing)* - Combinatorial map
*(computing)* - Contact graph
*(computing)*

### D

- Dodecahedron
*(computing)* - Dual graph
*(computing)* - Dürer graph
*(computing)*

### E

- Eodermdrome
*(computing)* - Errera graph
*(computing)*

### F

- Fáry's theorem
*(computing)* - FKT algorithm
*(computing)* - Four color theorem
*(computing)* - Left-right planarity test
*(computing)* - Friendship graph
*(computing)* - Fritsch graph
*(computing)* - Frucht graph
*(computing)*

### G

- Goldner–Harary graph
*(computing)* - Golomb graph
*(computing)* - Good spanning tree
*(computing)* - Graphic matroid
*(computing)* - Grinberg's theorem
*(computing)* - Grötzsch's theorem
*(computing)*

### H

- Halin graph
*(computing)* - Hanani–Tutte theorem
*(computing)* - Hanoi graph
*(computing)* - Harborth's conjecture
*(computing)* - Herschel graph
*(computing)*

### K

- K-outerplanar graph
*(computing)* - Kelmans–Seymour conjecture
*(computing)* - Kittell graph
*(computing)* - Kotzig's theorem
*(computing)* - Kuratowski's theorem
*(computing)*

### L

- Ladder graph
*(computing)* - Lattice graph
*(computing)*

### M

- Mac Lane's planarity criterion
*(computing)* - Map graph
*(computing)* - Medial graph
*(computing)* - Meshedness coefficient
*(computing)* - Moser spindle
*(computing)*

### N

- Nested triangles graph
*(computing)*

### O

- Outerplanar graph
*(computing)*

### P

- Penny graph
*(computing)* - Peripheral cycle
*(computing)* - Planar separator theorem
*(computing)* - Planar straight-line graph
*(computing)* - Planarity
*(computing)* - Planarity testing
*(computing)* - Planarization
*(computing)* - Platonic graph
*(computing)* - Polyhedral graph
*(computing)* - Prism graph
*(computing)*

### R

- Regular dodecahedron
*(computing)* - Regular icosahedron
*(computing)*

### S

- Scheinerman's conjecture
*(computing)* - Schnyder's theorem
*(computing)* - Series-parallel graph
*(computing)* - Squaregraph
*(computing)* - St-planar graph
*(computing)* - Steinitz's theorem
*(computing)* - Strangulated graph
*(computing)* - Subhamiltonian graph
*(computing)*

### T

- Tait's conjecture
*(computing)* - Thickness (graph theory)
*(computing)* - Truncated icosidodecahedron
*(computing)* - Truncated tetrahedron
*(computing)* - Tutte embedding
*(computing)* - Tutte graph
*(computing)*

### U

- Universal point set
*(computing)* - Upward planar drawing
*(computing)*

### W

- Wagner's theorem
*(computing)* - Wheel graph
*(computing)* - Whitney's planarity criterion
*(computing)* - Wiener–Araya graph
*(computing)*