{"id":68,"date":"2020-10-02T12:29:47","date_gmt":"2020-10-02T10:29:47","guid":{"rendered":"http:\/\/aud.ibr.cs.tu-bs.de\/?page_id=68"},"modified":"2021-09-24T18:50:18","modified_gmt":"2021-09-24T16:50:18","slug":"kapitel-2","status":"publish","type":"page","link":"https:\/\/aud.ibr.cs.tu-bs.de\/kapitel\/kapitel-2\/","title":{"rendered":"Kapitel 2 &#8211; Graphen"},"content":{"rendered":"\n<p>Mit Graphen lassen sich zahllose diskrete Strukturen darstellen. Zugleich beruhen sehr viele algorithmische Probleme auf der Betrachtung von Graphen. In diesem Kapitel werden wir eines davon betrachten: Wann und wie lassen sich alle Kanten eines Graphen in einem Zug ablaufen, ohne abzusetzen?<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Vorlesungen<\/h2>\n\n\n<ul class=\"wp-block-latest-posts__list has-dates wp-block-latest-posts\"><li><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/grosse-uebung-10-fragestunde\/\">Gro\u00dfe \u00dcbung 9 &#8211; Fragestunde<\/a><time datetime=\"2023-02-09T11:15:00+01:00\" class=\"wp-block-latest-posts__post-date\">9. Februar 2023<\/time><div class=\"wp-block-latest-posts__post-excerpt\">Quiz und ganz viel aus der Vorlesung!<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" width=\"300\" height=\"137\" src=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/koenig-new.png\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-4\/\">Vorlesung 4<\/a><time datetime=\"2022-11-15T09:30:00+01:00\" class=\"wp-block-latest-posts__post-date\">15. November 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung werden notwendige Bedingungen f\u00fcr Eulertouren erleutert. Zus\u00e4tzlich wird das Kapitel 2 noch einmal zusammengefasst.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" width=\"300\" height=\"169\" src=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/slide-300x169.png\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" srcset=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/slide-300x169.png 300w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/slide-e1604588934992-150x84.png 150w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/slide-768x432.png 768w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/slide-816x459.png 816w, https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/11\/slide.png 960w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/uebung-1\/\">\u00dcbung 1<\/a><time datetime=\"2022-11-10T14:35:00+01:00\" class=\"wp-block-latest-posts__post-date\">10. November 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser \u00dcbung betrachten wir erste Methoden, um mathematische Aussagen zu beweisen.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" width=\"300\" height=\"139\" src=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/Path_and_walk.svg_.png\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-3\/\">Vorlesung 3<\/a><time datetime=\"2022-11-09T11:15:00+01:00\" class=\"wp-block-latest-posts__post-date\">9. November 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung besch\u00e4ftigen wir uns mit der formalen Definition von Graphen und Wegen in Graphen.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img loading=\"lazy\" width=\"300\" height=\"236\" src=\"https:\/\/aud.ibr.cs.tu-bs.de\/wp-content\/uploads\/2020\/10\/Konigsberg_bridges.png\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud.ibr.cs.tu-bs.de\/vorlesung-2\/\">Vorlesung 2<\/a><time datetime=\"2022-11-08T09:30:00+01:00\" class=\"wp-block-latest-posts__post-date\">8. November 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung werden Graphen eingef\u00fchrt und verschiedene verwandte Probleme besprochen.<\/div><\/li>\n<\/ul>\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Mit Graphen lassen sich zahllose diskrete Strukturen darstellen. Zugleich beruhen sehr viele algorithmische Probleme auf der Betrachtung von Graphen. In diesem Kapitel werden wir eines davon betrachten: Wann und wie \u00a0\u2026 <a href=\"https:\/\/aud.ibr.cs.tu-bs.de\/kapitel\/kapitel-2\/\" rel=\"noopener noreferrer\">Weiterlesen<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":30,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_uag_custom_page_level_css":"","site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"","footnotes":""},"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":false},"uagb_author_info":{"display_name":"Matthias Konitzny","author_link":"https:\/\/aud.ibr.cs.tu-bs.de\/author\/konitzny\/"},"uagb_comment_info":0,"uagb_excerpt":"Mit Graphen lassen sich zahllose diskrete Strukturen darstellen. Zugleich beruhen sehr viele algorithmische Probleme auf der Betrachtung von Graphen. In diesem Kapitel werden wir eines davon betrachten: Wann und wie \u00a0\u2026 Weiterlesen","_links":{"self":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/pages\/68"}],"collection":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/comments?post=68"}],"version-history":[{"count":12,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/pages\/68\/revisions"}],"predecessor-version":[{"id":702,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/pages\/68\/revisions\/702"}],"up":[{"embeddable":true,"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/pages\/30"}],"wp:attachment":[{"href":"https:\/\/aud.ibr.cs.tu-bs.de\/wp-json\/wp\/v2\/media?parent=68"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}