Grafos hamiltonianos con vértices de grado 2 | 38/42 | UPV

Title: Hamiltonian Graphs with Degree 2 Vertices Description: This method explains an iterative method that determines whether a graph is Hamiltonian or not. The idea of ​​the method is based on the fact that in a cycle, exactly two of the edges incident on each of its vertices appear, so it is generally applied when vertices of degree 2 exist. Jordan Lluch, C. (2010). Hamiltonian Graphs with Degree 2 Vertices. http://hdl.handle.net/10251/7870 Author: Jordan Lluch Cristina Course: This video is 38/42 of the Basic Graph Theory and Analysis of 4 Well-Known Problems course | Polytechnic University of Valencia (UPV).    • Curso Teoría básica de grafos y análisis d...   Polytechnic University of Valencia (UPV): https://www.upv.es More videos at:    / valenciaupv   Access our MOOCs: https://upvx.es #Hamiltonian #Hamiltonian Cycle #Degree Two #APPLIED MATHEMATICS