Category:Planar graphs

• Planar graph

0–9

• 1-planar graph
• 26-fullerene graph

A

• Antiprism graph
• Apex graph
• Apollonian network
• Archimedean graph

B

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

C

• Cactus graph
• Circle packing theorem
• Combinatorial map
• Contact graph
• Convex drawing

D

• Dodecahedron
• Dual graph
• Dürer graph

E

• Eodermdrome
• Errera graph

F

• Fáry's theorem
• FKT algorithm
• Four color theorem
• Left-right planarity test
• Friendship graph
• Frucht graph

G

• Goldner–Harary graph
• Golomb graph
• Good spanning tree
• Graphic matroid
• Grinberg's theorem
• Grötzsch's theorem

H

• Halin graph
• Hanani–Tutte theorem
• Hanoi graph
• Harborth's conjecture
• Herschel graph

K

• K-outerplanar graph
• Kelmans–Seymour conjecture
• Kittell graph
• Kotzig's theorem
• Kuratowski's theorem

L

• Ladder graph
• Lattice graph

M

• Mac Lane's planarity criterion
• Map graph
• Medial graph
• Meshedness coefficient
• Moser spindle

N

• Nested triangles graph

O

• Outerplanar graph

P

• Penny graph
• Peripheral cycle
• Planar separator theorem
• Planar straight-line graph
• Planarity
• Planarity testing
• Planarization
• Polyhedral graph
• Prism graph

R

• Regular dodecahedron
• Regular icosahedron

S

• Scheinerman's conjecture
• Schnyder's theorem
• Series–parallel graph
• Squaregraph
• St-planar graph
• Steinitz's theorem
• Strangulated graph
• Subhamiltonian graph

T

• Tait's conjecture
• Thickness (graph theory)
• Truncated icosidodecahedron
• Truncated tetrahedron
• Tutte embedding
• Tutte graph

U

• Universal point set
• Upward planar drawing

W

• Wagner's theorem
• Walther graph
• Wheel graph
• Whitney's planarity criterion
• Wiener–Araya graph