-
481348
Caption: K4 is planar, as its vertices can connect without intersecting lines, while K5 is not planar, as it must use a third dimension.
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 23.02 MB
-
481230
Caption: A bipartite map contains 2 sets of points such that every vertex in one can be connected to every vertex in the other without intersecting paths.
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 35.78 MB
-
481283
Caption: A Eulerian circuit is a path that traverses each edge exactly once such that the path begins and ends at the same vertex.
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 38.26 MB
-
506622
Caption: Standard lettering of a triangle: angles (A, B, C), sides (a, b, c), and one of the three heights (h, drawn from a vertices)
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 24.86 MB
-
481078
Caption: K5 is not a planar graph, as there is no way to connect every vertex with edges in the plane such that no edges intersect.
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 37.75 MB
-
481435
Caption: Basic types of graphs: simple graph, multigraph, complete graph, graph with loop, and digraph.
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 30.44 MB
-
481148
Caption: Dudeney puzzle (K3,3 bipartite graph): the houses cannot connect to the separate utilities such that no service pipes intersect.
Artist: Encyclopaedia Britannica
Release: Not Applicable
File Size: 33.25 MB