The connectivity of the flip graph of Hamiltonian paths of the grid graph

Duque, Frank; Fabila Monroy, Ruy; Flores Peñazola, David; Hidalgo Toscano, Carlos; Huemer, Clemens

View/Open

The connectivity of the flip graph of Hamiltonian paths of the grid graph.pdf (12,63Mb)

View UPCommons Usage Statistics

LA Referencia / Recolecta stats

Cita com:

Show full item record

Duque, Frank

Fabila Monroy, Ruy

Flores Peñazola, David

Hidalgo Toscano, Carlos

Huemer, Clemens

Document typeConference report

Defense date2017

Rights accessOpen Access

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder

Abstract

Let Gn,m be the grid graph with n columns and m rows. Let Hn,m be the graph whose vertices are the Hamiltonian paths in Gn,m, where two vertices P1 and P2 are adjacent if we can obtain P2 from P1 by deleting an edge in P1 and adding an edge not in P1. In this paper we show that Hn,2, Hn,3 and Hn,4 are connected

CitationDuque, F., Fabila, R., Flores, D., Hidalgo, C., Huemer, C. The connectivity of the flip graph of Hamiltonian paths of the grid graph. A: Encuentros de Geometría Computacional. "XVII Spanish Meeting on Computational Geometry: Alicante, June 26-28: Book of Abstracts". Alicante: 2017, p. 65-68.

URIhttp://hdl.handle.net/2117/113119

Publisher versionhttps://dmat.ua.es/es/egc17/documentos/book-of-abstracts.pdf

Collections

View UPCommons Usage Statistics

Show full item record

Files	Description	Size	Format	View
The connectivit ... aths of the grid graph.pdf		12,63Mb	PDF	View/Open

UPCommons. Global access to UPC knowledge

The connectivity of the flip graph of Hamiltonian paths of the grid graph

View/Open

Browse