the language, properties and types of graphs, including edge, face, loop, vertex, the degree of a vertex, isomorphic and connected graphs, and the adjacency matrix, Euler’s formula for planar graphs, and walks, trails, paths, circuits, bridges and cycles in the context of traversing a graph
U2.AoS2.4
describe a planar graph in terms of the number of faces (regions), vertices and edges and apply Euler’s formula to solve associated problems
