Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
61.603 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
  • Ponències/Comunicacions de congressos
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
  • Ponències/Comunicacions de congressos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
View/Open
The connectivity of the flip graph of Hamiltonian paths of the grid graph.pdf (12,63Mb)
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/113119

Show full item record
Duque, Frank
Fabila Monroy, Ruy
Flores Peñazola, David
Hidalgo Toscano, Carlos
Huemer, ClemensMés informacióMés informacióMés informació
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
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta - Ponències/Comunicacions de congressos [68]
  • Departament de Matemàtiques - Ponències/Comunicacions de congressos [1.057]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
The connectivit ... aths of the grid graph.pdf12,63MbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina