
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
- Decide whether each graph is bipartite.
- Hannah runs a science fair with 12 judges and 14 projects.
- A B C D E F G H Lily assigns eight campers A to H to two cabins.
- Priya runs a sports camp with five stations a to e and five drills 1 to 5.
- Prove that a graph G is bipartite if and only if, for every two vertices u and v of G (not necessarily different), all walks from u to v have…
- A deck of 52 cards has 13 ranks, with exactly 4 cards of each rank.
Teach it first
The free lesson teaches it with worked examples and practice problems.
Bipartite 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