Traceability of locally hamiltonian and locally traceable graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2016

Traceability of locally hamiltonian and locally traceable graphs

Abstract

If $\mathcal{P}$ is a given graph property, we say that a graph $G$ is locally $\mathcal{P}$ if $\langle N(v) \rangle$ has property $\mathcal{P}$ for every $v \in V(G)$ where $\langle N(v) \rangle$ is the induced graph on the open neighbourhood of the vertex $v$. Pareek and Skupien (C. M. Pareek and Z. Skupien , On the smallest non-Hamiltonian locally Hamiltonian graph, J. Univ. Kuwait (Sci.), 10:9 - 17, 1983) posed the following two questions. Question 1 Is 9 the smallest order of a connected nontraceable locally traceable graph? Question 2 Is 14 the smallest order of a connected nontraceable locally hamiltonian graph? We answer the second question in the affirmative, but show that the correct number for the first question is 10. We develop a technique to construct connected locally hamiltonian and locally traceable graphs that are not traceable. We use this technique to construct such graphs with various prescribed properties.
Fichier principal
Vignette du fichier
2800-9958-1-PB.pdf (582.98 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...

Dates and versions

hal-01352838 , version 1 (16-08-2016)

Identifiers

Cite

Johan de Wet, Susan van Aardt. Traceability of locally hamiltonian and locally traceable graphs. Discrete Mathematics and Theoretical Computer Science, 2016, Vol. 17 no. 3 (3), pp.245-262. ⟨10.46298/dmtcs.2144⟩. ⟨hal-01352838⟩

Collections

TDS-MACS
82 View
880 Download

Altmetric

Share

Gmail Facebook X LinkedIn More