Related papers: Essential paths space on ADE SU(3) graphs: A geome…
Given two points on a soup can or conical cup with lid, we find and classify all paths of minimal length connecting them. When the number of minimal paths is finite, there are at most four on a can and three on a cup. At worst, minimal…
We present an exact formula for the ordinary generating series of the simple paths between any two vertices of a graph. Our formula involves the adjacency matrix of the connected induced subgraphs and remains valid on weighted and directed…
This survey gives a brief overview of theoretically and practically relevant algorithms to compute geodesic paths and distances on three-dimensional surfaces. The survey focuses on polyhedral three-dimensional surfaces.
This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be…
We prove that the cycle space of every planar finitely separable 3-connected graph $G$ is generated by some ${\rm Aut}(G)$-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.
We give a construction that provides infinitely many 2-connected, cubic, bipartite, and planar graphs G with 3k vertices and such that the number of disjoint copies of a 3-vertex path in G is less than k.
In this work we study a linear operator $f$ on a pre-euclidean space $\mathcal{V}$ by using properties of a corresponding graph. Given a basis $\B$ of $\mathcal{V}$, we present a decomposition of $\mathcal{V}$ as an orthogonal direct sum of…
The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.
For any field $K$ and for a completely arbitrary graph $E$, we characterize the Leavitt path algebras $L_K(E)$ that are indecomposable (as a direct sum of two-sided ideals) in terms of the underlying graph. When the algebra decomposes, it…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
We show that the edges of any $d$-regular graph can be almost decomposed into paths of length roughly $d$, giving an approximate solution to a problem of Kotzig from 1957. Along the way, we show that almost all of the vertices of a…
Contact path geometries are curved geometric structures on a contact manifold comprising smooth families of paths modeled on the family of all isotropic lines in the projectivization of a symplectic vector space. Locally such a structure is…
Gallai's conjecture asserts that every connected graph on $n$ vertices can be decomposed into $\frac{n+1}{2}$ paths. For general graphs (possibly disconnected), it was proved that every graph on $n$ vertices can be decomposed into…
A finite subgroup of the conformal group SL(2,C) can be related to invariant polynomials on a hypersurface in C^3. The latter then carries a simple singularity, which resolves by a finite iteration of basic cycles of deprojections. The…
A well known theorem in graph theory states that every graph $G$ on $n$ vertices and minimum degree at least $d$ contains a path of length at least $d$, and if $G$ is connected and $n\ge 2d+1$ then $G$ contains a path of length at least…
In 2006, Bar\'at and Thomassen posed the following conjecture: for each tree $T$, there exists a natural number $k_T$ such that, if $G$ is a $k_T$-edge-connected graph and $|E(G)|$ is divisible by $|E(T)|$, then $G$ admits a decomposition…
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open…
We make progress on three long standing conjectures from the 1960s about path and cycle decompositions of graphs. Gallai conjectured that any connected graph on $n$ vertices can be decomposed into at most $\left\lceil…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
In a strongly connected graph $G = (V,E)$, a cut arc (also called strong bridge) is an arc $e \in E$ whose removal makes the graph no longer strongly connected. Equivalently, there exist $u,v \in V$, such that all $u$-$v$ walks contain $e$.…