
Page 1 of 3
Download
Get this sheet
SubscriptionOpen any sheet in any course, up to 40 a month, keys included. Or $40 month to month.
$25/mo, billed yearly
SubscribeTry one first: a free Chapter 1 worksheet (PDF, no sign-in).
What's on the worksheet
- A greenhouse robot tends 3 rows of plant beds, with 5 beds in each row, set out in a rectangular grid.
- In a word ladder, one move changes one letter of a word, keeping the other letters in their places, and every word on the way must be on an allowed…
- L A B C D E F S The figure shows the rooms of a small museum as vertices, with an edge for each doorway:
- The complement G of a graph G has the same vertices as G, two vertices adjacent in G exactly when they are not adjacent in G.
- Let G be a graph with vertex set V.
Teach it first
The free lesson teaches it with worked examples and practice problems.
Walks, paths, cycles and connected graphs: the lesson ›More Chapter 10 worksheets: Graphs
- 10.1Degree, the handshake lemma and complete graphs
- 10.2Walks, paths, cycles and connected graphs
- 10.3Graph isomorphism: when two drawings are the same graph
- 10.4Euler paths and circuits
- 10.5Hamiltonian paths and cycles
- 10.6Trees
- 10.7Planar graphs and Euler's formula
- 10.8Graph coloring
- 10.9Bipartite graphs
- 10.10Weighted and directed graphs
- 10.11Finding a shortest path
- 10.12Spanning trees and minimum spanning trees
- 10.13Adjacency matrices and their powers