Difference between revisions of "Math 355: Graph Theory"
From MathWiki
(→Minimal learning outcomes) |
(→Minimal learning outcomes) |
||
| Line 21: | Line 21: | ||
=== Minimal learning outcomes === | === Minimal learning outcomes === | ||
| − | + | Graphs, trees, pathes and cycles, connectedness, chromatic number, planarity conditions, genus of a graph, the Five Color Theorem. Students should also be aware of Kuratowsky's Theorem, and the Four Color Theorem. If there is time, it is good to do the proof of Kuratowski's Theorem. | |
<div style="-moz-column-count:2; column-count:2;"> | <div style="-moz-column-count:2; column-count:2;"> | ||
</div> | </div> | ||
| + | |||
=== Textbooks === | === Textbooks === | ||
Possible textbooks for this course include (but are not limited to): | Possible textbooks for this course include (but are not limited to): | ||
Revision as of 09:47, 1 November 2010
Contents
Catalog Information
Title
Graph Theory.
(Credit Hours:Lecture Hours:Lab Hours)
(3:3:0)
Offered
W
Prerequisite
Description
Maps, graphs and digraphs, coloring problems, applications.
Desired Learning Outcomes
Prerequisites
Minimal learning outcomes
Graphs, trees, pathes and cycles, connectedness, chromatic number, planarity conditions, genus of a graph, the Five Color Theorem. Students should also be aware of Kuratowsky's Theorem, and the Four Color Theorem. If there is time, it is good to do the proof of Kuratowski's Theorem.
Textbooks
Possible textbooks for this course include (but are not limited to):
