It is well known that, given n red points and n blue points on a circle, it is not always possible to find a plane geometric Hamiltonian alternating path. In this work we prove that if we relax the constraint on the path from being plane to being 1-plane, then the problem always has a solution, and even a Hamiltonian alternating cycle can be...
-
May 23, 2017 (v1)PublicationUploaded on: December 4, 2022
-
November 21, 2018 (v1)Publication
En eta memoria estudiamos diversos aspectos del polinomio de Tutte de una teselación regular. Comenzamos introduciendo algunas definiciones y resultados significativos de Teoría de Grafos. En primer lugar nos centramos en el cálculo del polinomio de Tutte de Teselaciones o masaicos del plano mediante cuadrados, triángulos , hexágonos y las...
Uploaded on: December 4, 2022