{"id":294,"date":"2017-06-13T23:22:18","date_gmt":"2017-06-13T23:22:18","guid":{"rendered":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/?post_type=chapter&#038;p=294"},"modified":"2017-06-13T23:22:18","modified_gmt":"2017-06-13T23:22:18","slug":"assignment-euler-and-hamiltonian-circuits","status":"publish","type":"chapter","link":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/chapter\/assignment-euler-and-hamiltonian-circuits\/","title":{"raw":"Assignment: Euler and Hamiltonian Circuits","rendered":"Assignment: Euler and Hamiltonian Circuits"},"content":{"raw":"<ol><li>You and your friends want to tour the southwest by car. You will visit the nine states below, with the following rather odd rule: you must cross each border between neighboring states exactly once (so, for example, you must cross the Colorado-Utah border exactly once). Can you do it? If so, does it matter where you start your road trip? What fact about graph theory solves this problem?\n<a href=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/1141\/2017\/03\/17171703\/Screen-Shot-2017-03-17-at-10.16.46-AM.png\"><img class=\"wp-image-1901 aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/165\/2017\/06\/13230015\/Screen-Shot-2017-03-17-at-10.16.46-AM.png\" alt=\"Map of the US with the following states shaded: California, Arizona, New Mexico, Texas, Oklahoma, Nebraska, Colorado, Utah, Nevada. Each of the states shares a border with another of the states listed.\" width=\"435\" height=\"320\"\/><\/a><\/li>\n \t<li>Below is a graph representing friendships between a group of students (each vertex is a student and each edge is a friendship). Is it possible for the students to sit around a round table in such a way that every student sits between two friends? What does this question have to do with paths?<\/li>\n<\/ol>\n\u00a0\n\n<a href=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/1141\/2017\/03\/17172022\/Screen-Shot-2017-03-17-at-10.19.40-AM.png\"><img class=\"wp-image-1902 aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/165\/2017\/06\/13230016\/Screen-Shot-2017-03-17-at-10.19.40-AM.png\" alt=\"\" width=\"377\" height=\"363\"\/><\/a>\n\n\u00a0\n<p class=\"p1\"\/>\n<p class=\"p1\">Download the assignment from one of the links below (.docx or .rtf):<\/p>\n<p class=\"p2\"><a href=\"https:\/\/s3-us-west-2.amazonaws.com\/oerfiles\/WM+Math+For+Liberal+Arts\/Euler+and+Hamiltonian+Circuits.docx\">Euler and Hamiltonian Circuits: Word Document<\/a><\/p>\n<p class=\"p2\"><a href=\"https:\/\/s3-us-west-2.amazonaws.com\/oerfiles\/WM+Math+For+Liberal+Arts\/Euler+and+Hamiltonian+Circuits.rtf\">Euler and Hamiltonian Circuits: Rich Text Format<\/a><\/p>","rendered":"<ol>\n<li>You and your friends want to tour the southwest by car. You will visit the nine states below, with the following rather odd rule: you must cross each border between neighboring states exactly once (so, for example, you must cross the Colorado-Utah border exactly once). Can you do it? If so, does it matter where you start your road trip? What fact about graph theory solves this problem?<br \/>\n<a href=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/1141\/2017\/03\/17171703\/Screen-Shot-2017-03-17-at-10.16.46-AM.png\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-1901 aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/165\/2017\/06\/13230015\/Screen-Shot-2017-03-17-at-10.16.46-AM.png\" alt=\"Map of the US with the following states shaded: California, Arizona, New Mexico, Texas, Oklahoma, Nebraska, Colorado, Utah, Nevada. Each of the states shares a border with another of the states listed.\" width=\"435\" height=\"320\" \/><\/a><\/li>\n<li>Below is a graph representing friendships between a group of students (each vertex is a student and each edge is a friendship). Is it possible for the students to sit around a round table in such a way that every student sits between two friends? What does this question have to do with paths?<\/li>\n<\/ol>\n<p>\u00a0<\/p>\n<p><a href=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/1141\/2017\/03\/17172022\/Screen-Shot-2017-03-17-at-10.19.40-AM.png\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-1902 aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/165\/2017\/06\/13230016\/Screen-Shot-2017-03-17-at-10.19.40-AM.png\" alt=\"\" width=\"377\" height=\"363\" \/><\/a><\/p>\n<p>\u00a0<\/p>\n<p class=\"p1\">\n<p class=\"p1\">Download the assignment from one of the links below (.docx or .rtf):<\/p>\n<p class=\"p2\"><a href=\"https:\/\/s3-us-west-2.amazonaws.com\/oerfiles\/WM+Math+For+Liberal+Arts\/Euler+and+Hamiltonian+Circuits.docx\">Euler and Hamiltonian Circuits: Word Document<\/a><\/p>\n<p class=\"p2\"><a href=\"https:\/\/s3-us-west-2.amazonaws.com\/oerfiles\/WM+Math+For+Liberal+Arts\/Euler+and+Hamiltonian+Circuits.rtf\">Euler and Hamiltonian Circuits: Rich Text Format<\/a><\/p>\n","protected":false},"author":21,"menu_order":6,"template":"","meta":{"_candela_citation":"[]","CANDELA_OUTCOMES_GUID":"","pb_show_title":"on","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":""},"chapter-type":[],"contributor":[],"license":[],"class_list":["post-294","chapter","type-chapter","status-publish","hentry"],"part":178,"_links":{"self":[{"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/pressbooks\/v2\/chapters\/294","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/wp\/v2\/users\/21"}],"version-history":[{"count":1,"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/pressbooks\/v2\/chapters\/294\/revisions"}],"predecessor-version":[{"id":925,"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/pressbooks\/v2\/chapters\/294\/revisions\/925"}],"part":[{"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/pressbooks\/v2\/parts\/178"}],"metadata":[{"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/pressbooks\/v2\/chapters\/294\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/wp\/v2\/media?parent=294"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/pressbooks\/v2\/chapter-type?post=294"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/wp\/v2\/contributor?post=294"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/suny-hccc-ma-124-1\/wp-json\/wp\/v2\/license?post=294"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}