
Page 1 of 4
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
- Find the chromatic number of each graph.
- A B C D E The figure shows a map of five rectangular countries A to E.
- Kofi runs a pet store with seven kinds of fish:
- The graph G has the eight vertices a_1, a_2, a_3, a_4, b_1, b_2, b_3, b_4, and a_i is joined to b_j exactly when i ≠ j; there are no other edges.
- Priya's chemistry class has 21 students, and she splits all of them into lab groups.
- Let G be a graph, let u and v be two vertices of G that are not adjacent, and let G + uv be the graph G with the edge uv added.
- Elena books rooms for n meetings.
Teach it first
The free lesson teaches it with worked examples and practice problems.
Graph coloring: 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