D1 Definitions
- Created by: amyclaire
- Created on: 13-06-18 12:44
I | Y | J | X | G | E | A | Y | V | F | X | C | M | C | J | P | L | P | G | K | F |
S | E | K | V | O | L | C | K | F | A | I | S | H | U | M | R | Q | B | P | U | D |
O | V | I | N | C | M | S | O | M | O | R | W | P | M | O | L | O | H | F | T | C |
M | I | Q | H | Y | D | I | F | M | O | T | O | A | G | J | C | O | W | Y | S | U |
O | V | T | P | Y | S | M | H | F | R | A | C | R | H | K | V | N | E | J | X | V |
R | B | E | A | C | R | P | T | P | J | M | X | G | Q | H | L | H | W | E | T | P |
P | X | T | R | N | B | L | A | Q | G | Y | J | D | M | T | F | P | K | D | S | Q |
H | T | M | G | E | K | E | P | D | B | C | X | E | G | A | E | A | X | L | G | K |
I | Y | Q | E | L | L | G | G | K | J | N | E | T | S | P | G | R | G | F | L | T |
C | Y | K | T | A | L | R | N | G | I | E | D | C | P | L | Q | G | J | O | C | N |
G | I | Q | I | V | E | A | I | B | U | C | S | E | A | A | S | E | D | M | N | L |
R | S | F | T | E | V | P | T | R | Y | A | D | N | N | C | Q | T | C | F | L | X |
A | Y | A | R | E | Y | H | A | E | O | J | L | N | N | I | E | E | G | K | C | X |
P | C | R | A | R | P | S | N | F | X | D | J | O | I | T | G | L | Y | M | M | K |
H | T | O | P | G | V | A | R | D | I | A | M | C | N | I | B | P | F | H | U | K |
K | N | G | I | E | E | O | E | J | J | W | B | C | G | R | G | M | Y | O | O | N |
L | B | D | B | D | A | G | T | U | X | V | O | Y | T | C | U | O | C | J | T | I |
J | D | X | D | N | R | J | L | A | A | I | Y | M | R | G | Y | C | R | H | X | L |
V | U | N | K | Q | O | T | A | I | B | M | K | A | E | X | Y | W | C | D | G | H |
X | Y | M | D | Q | H | J | S | D | M | B | M | Q | E | E | M | W | S | E | V | Q |
V | S | M | L | E | U | M | H | T | N | I | M | H | K | J | Q | N | W | B | Q | G |
Clues
- 2 sets of vertices X & Y, edges join X to Y not vertices within another set (9, 5)
- Every vertex directly connected by an edge to each of other vertices (8, 5)
- Graph where all vertices connected (9, 5)
- Longest path from source to sink node (8, 4)
- No loops, no more than one edge connecting each pair of vertices (6, 5)
- Number of arcs incident to a vertex (6, 7)
- Number of direct lines between vertices (9, 6)
- Show same information but drawn differently (10, 5)
- Starts at an unmatched node on one side of a bipartite graph and finishes at an unmatched node. Uses arcs that are alternately not in and in the initial matching (11, 4)
- Subgraph that is a tree and includes all vertices (8, 4)
Comments
No comments have yet been made