Show:
Euler
Color Mapping
Hamilton
Critical Path
100
The extraordinary mathematician who created the Euler Circuit
What is Leonard Euler
100
if you have a rectangle split into 6 even sections how many colors will you need to satisfy color mapping
what is 2
100
If the path ends at the starting vertex it is called what?
What is a Hamilton Circuit
100
A path of targeted vertices in a task graph is known as
What is a critical path
200
A path that uses each edge of a graph exactly once and ends at the starting vertex
What is a Euler Circuit
200
a way to arrange colors on a map without any of the colors being adjacent to one another
What is color mapping
200
The 19th century mathematician associated with the creation of the Hamilton circuit
What is Sir William Rowan Hamilton
200
As more vertices are added to a task graph, does it become more or less difficult to determine a critical path through inspection
What is more difficult
300
In what town in Europe did the citizens wonder if they could cross each one of the bridges in the town, only once?
What is Konigsberg
300
the minimum number of colors that can be used in a color map
What is chromatic number
300
In what field of mathematics were most of Hamilton's discoveries
What is algebra
300
The earliest that an activity can begin if all the activities preceding it begin as early as possible
What is earliest start time
400
How many bridges were in the town of Konigsberg?
What is 7
400
you have a rectangle with 8 even sections whats the chromatic number
What is 2
400
What is the term that describes the number of edges beginning at one vertex?
What is degree
400
In a typical bus route, what method would a coordinator use to determine the shortest route available and still reach all destinations?
What is earliest start time
500
With the given 7 bridges in Konigsberg, was it deemed possible or impossible to cross each bridge only once?
What is impossible
500
when was color mapping a large topic in the united states
what is the 19th century
500
what are the two ways Hamilton's idea can be achieved through the movement inside a graph?
What is paths and circuits
500
what is always the finishing value in a task graph?
What is end