A crossed graph is the name given by Brandenburg to a graph obtained from a polyhedron by drawing edges between every pair of vertices in all its faces. This process leaves triangular faces unchanged. The following table summarizes some special cases.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.