Related papers: Generalizing the Covering Path Problem on a Grid

The Sphere Covering Inequality was introduced in \cite{GM} (\emph{Invent. Math.}, 2018) as a sharp geometric inequality that provides a lower bound for the total area of two distinct surfaces of Gaussian curvature 1. These surfaces are…

We study convexity of image of a general multidimensional quadratic map. We split the full image into two parts by an appropriate hyperplane such that one part is compact, and formulate a sufficient condition for convexity of the compact…

We improve a lower bound for the smallest area of convex covers for closed unit curves from 0.0975 to 0.1, which makes it substantially closer to the current best upper bound 0.11023. We did this by considering the minimal area of convex…

In 2007, Arkin et al. initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They…

Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial…

We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = (V,E), a positive cost function c: V-> Z^{+}, a partition $P_1,..., P_r$ of the edge set $E$, and a parameter $k_i$ for each…

Here we investigate the canonical Gaussian map for higher multiple coverings of curves, the case of double coverings being completely understood thanks to previous work by Duflot. In particular, we prove that every smooth curve can be…

We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently closed curves of length 2) allowing translation and discrete rotations. In particular, we show that the solution is an equilateral triangle…

We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a…

The cycle double cover conjecture is a long standing problem in graph theory, which links local properties, the valency of a vertex and no bridges, and a global property of the graph, being covered by a particular set of cycles. We prove…

In this paper, we consider the problem of counting and sampling structures in graphs. We define a class of "edge universal labeling problems"---which include proper $k$-colorings, independent sets, and downsets---and describe simple…

In [C. Xue, C. Yerger: Optimal Pebbling on Grids, Graphs and Combinatorics] the authors conjecture that if every vertex of an infinite square grid is reachable from a pebble distribution, then the covering ratio of this distribution is at…

In this note, we prove the existence of a limiting distribution of the free path lengths on flat surfaces with circular obstacles as the radius of the obstacles goes to zero. Moreover, we relate this distribution to the distribution of the…

Motivated by an application to database linear querying, such as private information-retrieval protocols, we suggest a fundamental property of linear codes -- the generalized covering radius. The generalized covering-radius hierarchy of a…

This paper describes a simple greedy D-approximation algorithm for any covering problem whose objective function is submodular and non-decreasing, and whose feasible region can be expressed as the intersection of arbitrary (closed upwards)…

A ride sharing problem is considered where we are given a graph, whose edges are equipped with a travel cost, plus a set of objects, each associated with a transportation request given by a pair of origin and destination nodes. A vehicle…

There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see an entire rectangle, or along a staircase, or along an orthogonal path with at most $k$ bends. In this paper, we study all these…

A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected $n$-vertex graph has a path cover with at most $\lceil n/2 \rceil$ paths. We prove Gallai's conjecture for…

Traditional representations of graphs and their duals suggest the requirement that the dual vertices be placed inside their corresponding primal faces, and the edges of the dual graph cross only their corresponding primal edges. We consider…

We consider the edge- and vertex-isoperimetric probem on finite and infinite hexagonal grids: For a subset W of the hexagonal grid of given cardinality, we give a lower bound for the number of edges between W and its complement, and lower…