Related papers: Multicommodity Flows in Planar Graphs with Demands…
Almost $4$-connectivity is a weakening of $4$-connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let $G$ be an almost $4$-connected triangle-free planar graph, and let $H$ be an almost…
In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph) vertices are drawn as points in the plane and edges as orthogonal polylines starting with a vertical segment and ending with a horizontal segment. Edges may…
A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…
Flows over time are used to model many real-world logistic and routing problems. The networks underlying such problems -- streets, tracks, etc. -- are inherently undirected and directions are only imposed on them to reduce the danger of…
The planar laminar flow resulting from the impingement of two gaseous jets of different density issuing into an open space from aligned steadily fed slot nozzles of semi-width $R$ separated a distance $2H$ is investigated by numerical and…
In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply it to provide asymptotically faster algorithms for the maximum $s$-$t$ flow and maximum concurrent…
Granular flows down inclined channels with smooth boundaries are common in nature and in the industry. Nevertheless, the common setup of flat boundaries has comparatively been much less investigated than the bumpy boundaries one, which is…
A rectangular drawing of a planar graph $G$ is a planar drawing of $G$ in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segments, and faces are drawn as rectangles. Sometimes this latter…
The study of nowhere-zero flows began with a key observation of Tutte that in planar graphs, nowhere-zero k-flows are dual to k-colourings (in the form of k-tensions). Tutte conjectured that every graph without a cut-edge has a nowhere-zero…
We study the following combinatorial problem. Given a planar graph $G=(V,E)$ and a set of simple cycles $\mathcal C$ in $G$, find a planar embedding $\mathcal E$ of $G$ such that the number of cycles in $\mathcal C$ that bound a face in…
We identify incompressible planar linear flows that are generalizations of the well known one-parameter family characterized by the ratio of in-plane extension to (out-of-plane) vorticity. The latter `canonical' family is classified into…
We prove that every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian, and show that the 6-face condition is tight. Our results push the connectivity condition of the Barnette-Goodey conjecture to the weakest…
Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operational network contexts. Such…
The paper deals with first order self-adjoint elliptic differential operators on a smooth compact oriented surface with non-empty boundary. We consider such operators with self-adjoint local boundary conditions. The paper is focused on…
The only open case of Vizing's conjecture that every planar graph with $\Delta\geq 6$ is a class 1 graph is $\Delta = 6$. We give a short proof of the following statement: there is no 6-critical plane graph $G$, such that every vertex of…
We link regularity and smoothness analysis of multivariate vector subdivision schemes with network flow theory and with special linear optimization problems. This connection allows us to prove the existence of what we call optimal…
In this paper we introduce a geometric quantity, the $r$-multiplicity, that controls the length of a smooth curve as it evolves by curve shortening flow. The length estimates we obtain are used to prove results about the level set flow in…
Every finite graph admits a \emph{simple (topological) drawing}, that is, a drawing where every pair of edges intersects in at most one point. However, in combination with other restrictions simple drawings do not universally exist. For…
A graph is $1$-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges…
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.