{"id":10957,"date":"2020-04-26T12:13:06","date_gmt":"2020-04-26T12:13:06","guid":{"rendered":"http:\/\/blog.bachi.net\/?p=10957"},"modified":"2020-04-26T12:25:43","modified_gmt":"2020-04-26T12:25:43","slug":"youtube-sarada-herke-graph-theory","status":"publish","type":"post","link":"https:\/\/blog.bachi.net\/?p=10957","title":{"rendered":"YouTube: Sarada Herke &#8211; Graph Theory"},"content":{"rendered":"<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLGxuz-nmYlQOiIOriTXMEoGoybUC3Jmrn\">Graph Theory part-1<\/a><\/p>\n<ul>\n<li>Graph Theory: 01. Seven Bridges of Konigsberg<\/li>\n<li>Graph Theory: 02. Definition of a Graph<\/li>\n<li>Graph Theory: 03. Examples of Graphs<\/li>\n<li>Graph Theory: 04. Families of Graphs<\/li>\n<li>Graph Theory: 05. Connected and Regular Graphs<\/li>\n<li>Graph Theory: 06 Sum of Degrees is ALWAYS Twice the Number of Edges<\/li>\n<li>Graph Theory: 07 Adjacency Matrix and Incidence Matrix<\/li>\n<li>Graph Theory: 08-a Basic Problem Set (part 1\/2)<\/li>\n<li>Graph Theory: 08-b Basic Problem Set (part 2\/2)<\/li>\n<\/ul>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLGxuz-nmYlQOWynO1-O9SBboVyjSSrmXF\">Graph Theory part-2<\/a><\/p>\n<ul>\n<li>Graph Theory: 09. Graph Isomorphisms<\/li>\n<li>Graph Theory: 10. Isomorphic and Non-Isomorphic Graphs<\/li>\n<li>BONUS: 10-b Graph Theory with Sage<\/li>\n<li>Graph Theory: 11. Neighbourhood and Bipartite Test with Colours<\/li>\n<li>Graph Theory: 12. Spanning and Induced Subgraphs<\/li>\n<li>Graph Theory: 13. Degrees at Least Two Means a Cycle Exists<\/li>\n<\/ul>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLGxuz-nmYlQOwe-FPnmy8RA4nzpsygCPx\">Graph Theory part-3<\/a><\/p>\n<ul>\n<li>Graph Theory: 14a. Basic Graph Theory Problem Set 2<\/li>\n<li>Graph Theory: 14b. Basic Graph Theory Problem Set 2<\/li>\n<li>Graph Theory: 14c. Basic Graph Theory Problem Set 2<\/li>\n<li>Graph Theory: 15.There Exists a 3-Regular Graph of All Even Order at least 4<\/li>\n<li>Graph Theory: 16. Walks Trails and Paths<\/li>\n<li>Graph Theory: 17. Distance Between Vertices and Connected Components<\/li>\n<\/ul>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLGxuz-nmYlQOXFjanEQY4WHnPJnAYQSqP\">Graph Theory part-4<\/a><\/p>\n<ul>\n<li>Graph Theory: 18. Every Walk Contains a Path<\/li>\n<li>Graph Theory: 19. Graph is Bipartite iff No Odd Cycle<\/li>\n<li>Graph Theory: 20. Edge Weighted Shortest Path Problem<\/li>\n<li>Graph Theory: 21. Dijkstra&#8217;s Algorithm<\/li>\n<li>Graph Theory: 22. Dijkstra Algorithm Examples<\/li>\n<\/ul>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLGxuz-nmYlQPtH2TgH3MTTkrMYjKtltwk\">Graph Theory part-5<\/a><\/p>\n<ul>\n<li>Graph Theory: 23. Euler Trails and Euler Tours<\/li>\n<li>Graph Theory: 24. Euler Trail iff 0 or 2 Vertices of Odd Degree<\/li>\n<li>Graph Theory: 25. Graph Decompositions<\/li>\n<li>Graph Theory: 26. Cycle Decomposition iff All Vertices Have Even Degre<\/li>\n<li>Graph Theory: 27. Hamiltonian Graphs and Problem Set<\/li>\n<\/ul>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLGxuz-nmYlQMqbct_HCAgSmWEmuHvubXT\">Graph Theory part-6<\/a><\/p>\n<ul>\n<li>Graph Theory: 28. Hamiltonian Graph Problems<\/li>\n<li>Graph Theory: 29. Lovasz Conjecture on Hamilton Paths<\/li>\n<li>Graph Theory: 30. The 5 Known Vertex-Transitive Non-Hamiltonian Graphs<\/li>\n<li>Graph Theory: 31. Lemma on Hamiltonian Graphs<\/li>\n<li>Graph Theory: 32. Necessary (not sufficient) Condition for Existence of a Hamilton Cycle<\/li>\n<li>Graph Theory: 33. Petersen Graph is Not Hamiltonian<\/li>\n<\/ul>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLGxuz-nmYlQNCcfVYLs9G4dtFJDFUuo5A\">Graph Theory part-7<\/a><\/p>\n<ul>\n<li>Graph Theory: 34. Bridge edges<\/li>\n<li>Graph Theory: 35. Bridges in Connected Graphs<\/li>\n<li>Graph Theory: 36. Definition of a Tree<\/li>\n<li>Graph Theory 37. Which Graphs are Trees<\/li>\n<li>Graph Theory: 38. Three ways to Identify Trees<\/li>\n<li>Graph Theory: 39. Types of Trees<\/li>\n<li>Graph Theory: 40. Cayley&#8217;s Formula and Prufer Seqences part 1\/2<\/li>\n<li>Graph Theory: 41. Cayley&#8217;s Formula and Prufer Seqences part 2\/2<\/li>\n<\/ul>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLGxuz-nmYlQNtbShUqPRrMA8cQAc45L03\">Graph Theory part-8<\/a><\/p>\n<ul>\n<li>Graph Theory: 42. Degree Sequences and Graphical Sequences<\/li>\n<li>Graph Theory: 43. Havel-Hakimi Theorem on Graphical Sequences<\/li>\n<li>Graph Theory: 44. Degree Sequence of a Tree<\/li>\n<li>Graph Theory: 45. Specific Degrees in a Tree<\/li>\n<li>Graph Theory: 46. Relation Between Minimun Degree and Subtrees<\/li>\n<li>Graph Theory: 47. Subgraphs of Regular Graphs<\/li>\n<li>Graph Theory: 48. Complement of a Graph<\/li>\n<li>Graph Theory: 49. Cartesian Product of Graphs<\/li>\n<\/ul>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLGxuz-nmYlQONimToEreNmISXM808M5Ba\">Graph Theory part-9<\/a><\/p>\n<ul>\n<li>Graph Theory: 50. Maximum vs Maximal<\/li>\n<li>Graph Theory: 51. Eccentricity, Radius &#038; Diameter<\/li>\n<li>Graph Theory: 52. Radius and Diameter Examples<\/li>\n<li>Graph Theory: 53. Cut-Vertices<\/li>\n<li>Graph Theory: 54. Number of Cut-Vertices<\/li>\n<li>Graph Theory: 55. Bridges and Blocks<\/li>\n<li>Graph Theory: 56. Central Vertices are in a Single Block<\/li>\n<\/ul>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLGxuz-nmYlQPgIHbqWtgD-F7NnJuqs4fH\">Graph Theory part-10<\/a><\/p>\n<ul>\n<li>Graph Theory: 57. Planar Graphs<\/li>\n<li>Graph Theory: 58. Euler&#8217;s Formula for Plane Graphs<\/li>\n<li>Graph Theory: 59. Maximal Planar Graphs<\/li>\n<li>Graph Theory: 60. Non Planar Graphs<\/li>\n<li>Graph Theory: 61. Characterization of Planar Graphs<\/li>\n<li>Graph Theory: 62. Graph Minors and Wagner&#8217;s Theorem<\/li>\n<li>Graph Theory: 63. Petersen Graph is Non-Planar<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Graph Theory part-1 Graph Theory: 01. Seven Bridges of Konigsberg Graph Theory: 02. Definition of a Graph Graph Theory: 03. Examples of Graphs Graph Theory: 04. Families of Graphs Graph Theory: 05. Connected and Regular Graphs Graph Theory: 06 Sum of Degrees is ALWAYS Twice the Number of Edges Graph Theory: 07 Adjacency Matrix and [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-10957","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts\/10957","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=10957"}],"version-history":[{"count":4,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts\/10957\/revisions"}],"predecessor-version":[{"id":10961,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts\/10957\/revisions\/10961"}],"wp:attachment":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=10957"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=10957"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=10957"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}