AbstractUniversal traversal sequences for d-regular n-vertex graphs require length Ω(d2n2 + dn2 log(nd)), for 3 ⩽d⩽n3 − 2. This is nearly tight for d = Θ(n). We also introduce and study several variations on the problem, e.g., edge-universal traversal sequences, showing how improved lower bounds on these would improve the bounds given above
We prove that for k ≪4n regular resolution requires length nΩ(k) to establish that an Erdős–Rényi gr...
Abstract. We prove that it is consistent that ℵω is strong limit, 2ℵω is large and the universality ...
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(...
AbstractUniversal traversal sequences for cycles require length Ω(n1.43), improving the previous bou...
AbstractIn this paper we introduce a new notion of traversal sequences that we call exploration sequ...
The paper presents a simple construction of polynomial length universal traversal sequences for cycl...
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...
AbstractThe paper presents a simple construction of polynomial length universal traversal sequences ...
Abstract. A tour in a graph is a connected walk that visits every vertex at least once, and returns ...
One way to quantify how dense a multidag is in long paths is to find the largest n,m such that which...
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...
ASSTRACT. In the all-pair shortest distance problem, one computes the matrix D = (du), where dq is t...
We prove that for k ≪4n regular resolution requires length nΩ(k) to establish that an Erdős–Rényi gr...
Abstract. We prove that it is consistent that ℵω is strong limit, 2ℵω is large and the universality ...
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(...
AbstractUniversal traversal sequences for cycles require length Ω(n1.43), improving the previous bou...
AbstractIn this paper we introduce a new notion of traversal sequences that we call exploration sequ...
The paper presents a simple construction of polynomial length universal traversal sequences for cycl...
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...
AbstractThe paper presents a simple construction of polynomial length universal traversal sequences ...
Abstract. A tour in a graph is a connected walk that visits every vertex at least once, and returns ...
One way to quantify how dense a multidag is in long paths is to find the largest n,m such that which...
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...
ASSTRACT. In the all-pair shortest distance problem, one computes the matrix D = (du), where dq is t...
We prove that for k ≪4n regular resolution requires length nΩ(k) to establish that an Erdős–Rényi gr...
Abstract. We prove that it is consistent that ℵω is strong limit, 2ℵω is large and the universality ...
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