Stage 5 · Introduction to networks (Path) · Define a planar graph and apply Euler’s formula for planar graphs · Topic: Networks · Year 9, 10
Demonstrate that some graphs that have crossing edges are still planar if they can be redrawn so that no 2 edges cross
Dot point ID k-10-2022-stage-5-introduction-to-networks-path/itr-dpg-stg5-03 · NESA code MA_K_10_CP_ITR_DPG_STG5_03 · See it on the NSW Curriculum website ↗
↩SupportBuild the prerequisite skills first · 0 resources★EnrichExtension & rich tasks · 3 resources
Outcomes for this focus area (MA5-NET-P-01)
MA5-NET-P-01 solves problems involving the characteristics of graphs/networks, planar graphs and Eulerian trails and circuits (Path: Stn)Core resources for this dot point
On-level resources, grouped by type. Need the building blocks? Use Support. Ready for more? Use Enrich.
Interactive tool
- Interactive toolStarterMathigon: Planar graphs and Euler's formulaUse it for: Untangle graphs to make them planar and discover v - e + f = 2.
Focus area resources
Checked resources for Introduction to networks (Path) as a whole (not mapped to a single dot point).