1 Introduction  
1.1 Asterisked results  
1.2 General results  
1.3 Crossing critical graphs  

2 Specific graphs and graph families  
2.1 Complete multipartite graphs  
2.2 Complete graphs  
2.3 Circulant graphs  
2.4 Generalized Petersen graphs  
2.5 Path powers  
2.6 Knödel graphs  
2.7 Flower Snarks  
2.8 Hexagonal graph \(H_{3,n}\)  

3 Cartesian products of graphs  
3.1 Cartesian products of cycles, paths, and stars  
3.2 Cartesian products of paths with other graphs  
3.4 Cartesian products of stars with other graphs  
3.6 Cartesian products with 3-vertex graphs  
3.7 Cartesian products with 4-vertex graphs  
3.8 Cartesian products with 5-vertex graphs  
3.9 Cartesian products with 6-vertex graphs  
3.10 Cartesian products with graphs on 7 or more vertices  
3.11 Variants of toroidal grid graphs  

4 Join products of graphs  
4.1 Join products with 3-vertex graphs  
4.2 Join products with 4-vertex graphs  
4.3 Join products with 5-vertex graphs  
4.4 Join products with 6-vertex graphs  
4.5 Other join products  

5 Other kinds of graph products  
5.1 Strong products  

6 Hypercubes, meshes, and other recursive constructions  
6.1 Hypercubes and related constructions  
6.2 Complete mesh of trees  
6.3 Butterfly graphs  
6.4 Generalized fat trees  
6.5 Sierpiński and Sierpiński-like graphs  
6.6 Star maps and pancake graphs