Answer Key — Graph fundamentals
Graph theory & combinatorics
Do not share with students before practice tests.
Worksheets — Sets 1–10
| Set | Guidance | | --- | --- | | Set 1 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 2 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 3 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 4 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 5 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 6 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 7 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 8 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 9 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 10 | Graph fundamentals — verify written work and accept reasonable drawings. |
Worksheets — Sets 11–20
| Set | Guidance | | --- | --- | | Set 11 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 12 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 13 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 14 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 15 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 16 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 17 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 18 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 19 | Graph fundamentals — verify written work and accept reasonable drawings. | | Set 20 | Graph fundamentals — verify written work and accept reasonable drawings. |
Review tiers 1–10
- Checklists are parent-judged.
- Written items: verify against practice set patterns.
- Standard text: Graphs, digraphs, and basic terminology (vertices, edges, degree) Paths, cycles, connectivity, and components Trees and spanning trees; Cayley's formula (statement) Euler trails and circuits; Hamilton paths and cycles Planar graphs and Euler's formula (introduction)
Practice test scoring
| Tier | Pass guidance | | --- | --- | | 1–3 | Most oral tasks smooth; majority of written correct | | 4–6 | 7/10+ total with clear understanding | | 7–8 | 9/12+ with explanations | | 9–10 | Near-perfect; ready to move on |
___________________________ ___________________________ ___________________________ ___________________________ ___________________________ ___________________________