Journal Articles Journal of Interconnection Networks Year : 2011

Circuits in graphs through a prescribed set of ordered vertices

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.
Fichier principal
Vignette du fichier
join-final-noformat.pdf (403.8 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00585561 , version 1 (13-04-2011)

Identifiers

Cite

David Coudert, Frédéric Giroire, Ignasi Sau. 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⟩
286 View
265 Download

Altmetric

Share

More