New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Ciclos Eulerianos y Hamiltonianos

Quiz

Played 0

About this activity

Quiz sobre ciclos y caminos

Created by

Ecuador

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Ciclos Eulerianos y Hamiltonianos
 

Ciclos Eulerianos y HamiltonianosOnline version

Quiz sobre ciclos y caminos

by Emily Cárdenas
1

¿Qué es un ciclo euleriano en un grafo no dirigido?

2

¿Qué define a un ciclo hamiltoniano?

3

Condición necesaria para que exista un ciclo euleriano en un grafo no dirigido?

4

Si exactamente dos vértices tienen grado impar, ¿qué puede existir?

5

Diferencia clave entre Hamiltoniano y Euleriano?

6

¿Es posible que un grafo tenga un camino Hamiltoniano pero no un ciclo Hamiltoniano?

7

¿Qué problema de complejidad está asociado al ciclo hamiltoniano?

8

En un grafo conexo, si todos los vértices tienen grado par, ¿qué se garantiza?

9

Segunda condición típica de Dirac para Hamiltonianos?

10

¿Puede haber grafos Eulerianos que no tengan un Hamiltoniano?

Explicación

Explica que se exige cubrir cada arista una sola vez.

Se centra en vértices, no en aristas.

En grafos conexos, grado par en todos los vértices garantiza ciclo euleriano.

Con dos grados impares, solo hay trazo que usa cada arista exactamente una vez.

Hamiltoniano se refiere a visitar vértices; Euleriano a aristas.

Un Hamiltoniano puede existir sin formar un ciclo al terminar.

Encontrar Hamiltonianos es un problema NP-completo conocido.

Propiedad suficiente para un ciclo que recorre todas las aristas.

Dirac da una cota suficiente para Hamiltoniano.

La existencia de un ciclo euleriano no implica un Hamiltoniano.

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.