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

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/113119

Title:	The connectivity of the flip graph of Hamiltonian paths of the grid graph
Author:	Duque, Frank; Fabila Monroy, Ruy; Flores Peñazola, David; Hidalgo Toscano, Carlos; Huemer, Clemens
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtiques; Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
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
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística -Graph theory -Grafs, Teoria de
Rights:
Document type:	Article - Published version Conference Object
Share: