Easy -1.8 This is a pure recall question worth only 2 marks, asking for a textbook definition with no application or problem-solving required. It tests only whether students remember the basic terminology of planar graphs, making it significantly easier than average A-level questions.
A graph is planar if it can be drawn in a plane in such a way that no two edges meet each other, except at a vertex to which they are both incident
B2, 1, 0
A graph is planar if it can be drawn in a plane in such a way that no two edges meet each other, except at a vertex to which they are both incident | B2, 1, 0 |
---