AbstractUniversal traversal sequences for cycles require length Ω(n1.43), improving the previous bound of Ω(n1.33). For d ≥ 3, universal traversal sequences for d-regular graphs require length Ω(d0.57n2.43). For constant d, the best previous bound was Ω(n2.33)
We study the complexity of compact routing on arbitrary networks. We give (1) networks on n vertices...
A limit of a sequence of graphs is an object that encodes approximate combinatorial information of t...
Let X be a regular graph with degree k ≥ 3 and order n. Then the number of spanning trees of X is κ(...
AbstractUniversal traversal sequences for d-regular n-vertex graphs require length Ω(d2n2 + dn2 log(...
The paper presents a simple construction of polynomial length universal traversal sequences for cycl...
AbstractThe paper presents a simple construction of polynomial length universal traversal sequences ...
AbstractIn this paper we introduce a new notion of traversal sequences that we call exploration sequ...
A strong node sequence for a directed graph G=(N,A) is a sequence of nodes containing every cycle-fr...
A strong node sequence for a directed graph G=(N,A) is a sequence of nodes containing every cycle-fr...
Abstract. We prove that it is consistent that ℵω is strong limit, 2ℵω is large and the universality ...
A universal cycle (u-cycle) is a compact listing of a collection of combinatorial objects. In this p...
International audienceA universal cycle for permutations of length $n$ is a cyclic word or permutati...
In 1999, Jacobson and Lehel conjectured that, for k >= 3, every k-regular Hamiltonian graph has cycl...
Abstract. A tour in a graph is a connected walk that visits every vertex at least once, and returns ...
It is well known that, when normalized by n, the expected length of a longest common subsequence of ...
We study the complexity of compact routing on arbitrary networks. We give (1) networks on n vertices...
A limit of a sequence of graphs is an object that encodes approximate combinatorial information of t...
Let X be a regular graph with degree k ≥ 3 and order n. Then the number of spanning trees of X is κ(...
AbstractUniversal traversal sequences for d-regular n-vertex graphs require length Ω(d2n2 + dn2 log(...
The paper presents a simple construction of polynomial length universal traversal sequences for cycl...
AbstractThe paper presents a simple construction of polynomial length universal traversal sequences ...
AbstractIn this paper we introduce a new notion of traversal sequences that we call exploration sequ...
A strong node sequence for a directed graph G=(N,A) is a sequence of nodes containing every cycle-fr...
A strong node sequence for a directed graph G=(N,A) is a sequence of nodes containing every cycle-fr...
Abstract. We prove that it is consistent that ℵω is strong limit, 2ℵω is large and the universality ...
A universal cycle (u-cycle) is a compact listing of a collection of combinatorial objects. In this p...
International audienceA universal cycle for permutations of length $n$ is a cyclic word or permutati...
In 1999, Jacobson and Lehel conjectured that, for k >= 3, every k-regular Hamiltonian graph has cycl...
Abstract. A tour in a graph is a connected walk that visits every vertex at least once, and returns ...
It is well known that, when normalized by n, the expected length of a longest common subsequence of ...
We study the complexity of compact routing on arbitrary networks. We give (1) networks on n vertices...
A limit of a sequence of graphs is an object that encodes approximate combinatorial information of t...
Let X be a regular graph with degree k ≥ 3 and order n. Then the number of spanning trees of X is κ(...
DOI
Add to ORKG