| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2003 |
| Session | January |
| Marks | 4 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Graph Theory Fundamentals |
| Type | Planarity algorithm application |
| Difficulty | Standard +0.3 This is a straightforward application of a standard algorithm (planarity algorithm) taught in D1, requiring methodical execution of learned steps rather than problem-solving or insight. The 4-mark allocation suggests a routine procedural question with clear marking points, making it easier than average A-level questions that typically require more synthesis or novel application. |
| Spec | 7.02m Euler's formula: V + R = E + 2 |
\includegraphics{figure_1}
Use the planarity algorithm to show that the graph in Fig. 1 is planar.
[4]
\hfill \mbox{\textit{Edexcel D1 2003 Q1 [4]}}