Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids

Abstract

A circuit in a simple undirected graph G = (V , E) is a sequence of vertices {v1 , v2 , . . . , vk+1 } such that v1 = vk+1 and {vi , vi+i } ∈ E for i = 1, . . . , k. A circuit C is said to be edge-simple if no edge of G is used twice in C . In this article we study the following problem: which is the largest integer k such that, given any subset of k ordered vertices of an infinite square grid, there exists an edge-simple circuit visiting the k vertices in the prescribed order? We prove that k = 10. To this end, we first provide a counterexample implying that k < 11. To show that k ≥ 10, we introduce a methodology, based on the notion of core graph, to reduce drastically the number of possible vertex configurations, and then we test each one of the resulting configurations with an ILP solver.
Fichier principal
Vignette du fichier
CGS09_IWOCA_nostyle.pdf (193.16 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00429146 , version 1 (31-10-2009)

Identifiers

  • HAL Id : inria-00429146 , version 1

Cite

David Coudert, Frédéric Giroire, Ignasi Sau. Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids. International Workshop on Combinatorial Algorithms -- IWOCA, Jun 2009, Hradec nad Moravicì, Czech Republic. ⟨inria-00429146⟩
206 View
205 Download

Share

Gmail Mastodon Facebook X LinkedIn More