Category:Individual graphs
 | Computing portal |
Here is a list of articles in the category Individual graphs of the Computing portal that unifies foundations of mathematics and computations using computers. This category is for individual graphs (in graph theory) sufficiently notable to be discussed in mathematics.
See also Category:Parametric families of graphs.
Pages in category "Individual graphs"
The following 99 pages are in this category, out of 99 total.
1
- 110-vertex Iofinova-Ivanov graph (computing)
- 120-cell (computing)
2
- 26-fullerene graph (computing)
B
- Balaban 10-cage (computing)
- Balaban 11-cage (computing)
- Barnette–Bosák–Lederberg graph (computing)
- Bidiakis cube (computing)
- Biggs–Smith graph (computing)
- Blanuša snarks (computing)
- Brinkmann graph (computing)
- Brouwer–Haemers graph (computing)
- Bull graph (computing)
- Butterfly graph (computing)
C
- Cameron graph (computing)
- Chang graphs (computing)
- Chvátal graph (computing)
- Clebsch graph (computing)
- Coxeter graph (computing)
D
- Dejter graph (computing)
- Desargues graph (computing)
- Diamond graph (computing)
- Dodecahedron (computing)
- Double-star snark (computing)
- Dürer graph (computing)
- Dyck graph (computing)
E
- Ellingham–Horton graph (computing)
- Errera graph (computing)
F
- F26A graph (computing)
- Folkman graph (computing)
- Foster cage (computing)
- Foster graph (computing)
- Franklin graph (computing)
- Fritsch graph (computing)
- Frucht graph (computing)
G
- Gewirtz graph (computing)
- Goldner–Harary graph (computing)
- Golomb graph (computing)
- Gosset graph (computing)
- Gray graph (computing)
- Grötzsch graph (computing)
H
- Hall–Janko graph (computing)
- Harborth graph (computing)
- Harries graph (computing)
- Harries–Wong graph (computing)
- Heawood graph (computing)
- Herschel graph (computing)
- Higman–Sims graph (computing)
- Hoffman graph (computing)
- Hoffman–Singleton graph (computing)
- Holt graph (computing)
- Horton graph (computing)
I
- Icosahedron (computing)
K
- Kittell graph (computing)
- Klein graphs (computing)
- Krackhardt kite graph (computing)
L
- Livingstone graph (computing)
- Ljubljana graph (computing)
- Loupekine snarks (computing)
M
- M22 graph (computing)
- Markström graph (computing)
- McGee graph (computing)
- McLaughlin graph (computing)
- Meredith graph (computing)
- Meringer graph (computing)
- Möbius–Kantor graph (computing)
- Moser spindle (computing)
N
- Nauru graph (computing)
O
- Octahedron (computing)
- Order-zero graph (computing)
P
- Pappus graph (computing)
- Perkel graph (computing)
- Petersen graph (computing)
- Poussin graph (computing)
R
- Rado graph (computing)
- Robertson graph (computing)
- Robertson–Wegner graph (computing)
S
- Schläfli graph (computing)
- Shrikhande graph (computing)
- Sousselier graph (computing)
- Suzuki graph (computing)
- Sylvester graph (computing)
- Szekeres snark (computing)
T
- Tetrahedron (computing)
- Thomsen graph (computing)
- Tietze's graph (computing)
- Triangle graph (computing)
- Truncated icosahedron (computing)
- Truncated icosidodecahedron (computing)
- Truncated tetrahedron (computing)
- Tutte 12-cage (computing)
- Tutte graph (computing)
- Tutte–Coxeter graph (computing)
U
- Utility graph (computing)
W
- Wagner graph (computing)
- Watkins snark (computing)
- Wells graph (computing)
- Wiener–Araya graph (computing)
- Wong graph (computing)
Y
- Young–Fibonacci lattice (computing)
Mathematics
Organizations
Books
About