Skip to Main content Skip to Navigation
New interface
Journal articles

Circuits in graphs through a prescribed set of ordered vertices

David Coudert 1 Frédéric Giroire 1 Ignasi Sau Valls 2 
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : A circuit in a simple undirected graph G=(V,E) is a sequence of vertices {v_1,v_2,...,v_{k+1}} such that v_1=v_{k+1} and {v_i,v_{i+1}} in 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 a graph G, there exists an edge-simple circuit visiting the k vertices in the prescribed order? We first study the case when G has maximum degree at most 3, establishing the value of k for several subcases, such as when G is planar or 3-vertex-connected. Our main result is that k=10 in infinite square grids. To prove this, we introduce a methodology based on the notion of core graph, in order to reduce the number of possible vertex configurations, and then we test each one of the resulting configurations with an Integer Linear Program (ILP) solver.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : David Coudert Connect in order to contact the contributor
Submitted on : Wednesday, April 13, 2011 - 12:06:08 PM
Last modification on : Tuesday, September 6, 2022 - 4:52:08 PM
Long-term archiving on: : Saturday, December 3, 2016 - 5:35:05 PM


Files produced by the author(s)



David Coudert, Frédéric Giroire, Ignasi Sau Valls. Circuits in graphs through a prescribed set of ordered vertices. Journal of Interconnection Networks, 2011, 11 (3-4), pp.121-141. ⟨10.1142/S0219265910002763⟩. ⟨inria-00585561⟩



Record views


Files downloads