OCR A-level Further Mathematics A H245 · 7.02
Graphs and Networks
- Code
- 7.02
- In
- 7 Discrete Mathematics
- Course
- A-level Further Mathematics A H245
- Board
- OCR
Grade boundaries·OCR command words
Codes and titles are read by a script from OCR's published specification and have not been checked by a person. What each point covers is in the specification itself: OCR’s specification.
Points under 7.02
- 7.02a Terminology and notation
- 7.02b Trees, simple and connected graphs
- 7.02c Walks, trails, paths, cycles and routes
- 7.02d Complete graphs
- 7.02e Bipartite graphs
- 7.02f Colouring arguments for bipartite graphs
- 7.02g Eulerian graphs
- 7.02h Hamiltonian graphs
- 7.02i Ore's theorem
- 7.02j Isomorphism
- 7.02k Digraphs
- 7.02l Planar graphs
- 7.02m Euler's formula for planar graphs
- 7.02n Kuratowski's theorem
- 7.02o Thickness of a graph
- 7.02p Using graphs and networks
- 7.02q Adjacency and weighted matrices
- 7.02r Modelling with graphs and networks