| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
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.
Cited literature [18 references]
https://hal.inria.fr/inria-00429146
Contributor : David Coudert <>
Submitted on : Saturday, October 31, 2009 - 3:12:59 PM
Last modification on : Tuesday, June 22, 2021 - 8:14:03 PM
Long-term archiving on: : Tuesday, October 16, 2012 - 1:01:48 PM
Contributor : David Coudert <>
Submitted on : Saturday, October 31, 2009 - 3:12:59 PM
Last modification on : Tuesday, June 22, 2021 - 8:14:03 PM
Long-term archiving on: : Tuesday, October 16, 2012 - 1:01:48 PM
File
CGS09_IWOCA_nostyle.pdf
Files produced by the author(s)