I have a complete graph.
I have an Euler circuit.
I have a weighted graph.
I have an Euler Path.
I have a Hamilton circuit.
Who has a graph that is
connected and has no vertices
of odd degree?
Who has every edge has been
assigned a number that could
represent time, distance, cost,
etc.?
Who has a graph that is
connected and has exactly two
vertices of odd degree?
Who has a path that goes
through each vertex exactly
once and returns to the starting
point?
Who has Seven Bridges?
I have Konigsberg.
I have vertex coloring.
I have the chromatic number.
I have a graph.
I have a cycle graph.
Who has a practical application
for solving conflict resolution
problems?
Who has the least number of
colors that can be used to color
the graph?
Who has a collection of points
some of which are joined by
line segments or curves
Who has vertices that are
connected by an edge?
I have adjacent vertices.
I have the Four Color Theorem.
I have the degree of a vertex.
Who has a graph where the
vertices can be arranged in a
circle so that each vertex is
adjacent to the vertices that
come before and after it?
I have a shortest path spanning
tree.
Who has the idea that a map on
a flat surface or sphere can be
colored with four colors?
Who has the number of edges
that enter a vertex?
Who has the shortest distance
from A to B and all the other
vertices along the way to B?
I have an arc.
I have a tree diagram.
I have the associated graph.
I have a node.
Who has a systematic way to
display all the solutions for a
shortest path problem?
Who has the name of the graph
that is colored with same
number of colors as the map
from which it was created?
Who has another name for a
vertex?
Who has the idea that if a
central region is surrounded by
an even number of regions,
then only 3 colors are needed?
Arizona Department of Education
Vertex-Edge Graphs
Who has a method of labeling
vertices and edges that results
in finding the shortest path?
9/2008
I have Dijkstra’s algorithm.
Who has another name for an
edge?
I have a general rule used in
coloring maps.
Who has another name for a
graph?
Handout 13
I have a network.
I have a disconnected graph.
Who has a graph that has two
vertices with no path
connecting them?
Who has a source of confusion
for students in solving conflict
resolution problems using
vertex-edge graphs?
I have an edge.
I have a vertex.
Who has a point or dot that is
connected to another point or
dot by an edge?
Who has a graph in which
every vertex is adjacent to
every other vertex?
Arizona Department of Education
I have connecting two things
that are in conflict.
Who has the Irish
mathematician who created a
puzzle made from pentagons
where vertices were cities and
edges were roads connecting
the cities?
Vertex-Edge Graphs
I have Sir Hamilton.
I have Euler’s Theorem.
Who has the very first theorem
in graph theory?
Who has a line segment or
curve that connects two
vertices?
9/2008
Handout 13