{"type":"video","version":"1.0","html":"<iframe src=\"https://www.loom.com/embed/81e3fe88072246518a9f1a9f88403b88\" frameborder=\"0\" width=\"1838\" height=\"1378\" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>","height":1378,"width":1838,"provider_name":"Loom","provider_url":"https://www.loom.com","thumbnail_height":1378,"thumbnail_width":1838,"thumbnail_url":"https://cdn.loom.com/sessions/thumbnails/81e3fe88072246518a9f1a9f88403b88-0a55534732d1ca70.gif","duration":2026.676,"title":"9FM0 D1 Set 3 - Graphs &amp; Planarity","description":"In this video, I walk through several graph theory concepts, focusing on Hamiltonian cycles, planarity, and isomorphism. I explain the definition of a Hamiltonian cycle, emphasizing the importance of visiting every vertex exactly once and returning to the start. I also demonstrate how to redraw a graph to show its planarity and discuss why the Planarity Algorithm cannot be applied due to the absence of a Hamiltonian cycle. Additionally, I analyze a given graph to determine its properties, including whether it is Eulerian or semi-Eulerian, and conclude that it is neither. I encourage viewers to carefully consider the definitions and properties discussed as they apply them to similar problems."}