Related papers: Drawing cubic graphs with the four basic slopes
It follows from the work of Tait and the Four-Color-Theorem that a planar cubic graph is 3-edge-colorable if and only if it contains no bridge. We consider the question of which planar graphs are subgraphs of planar cubic bridgeless graphs,…
We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and…
We present a construction which shows that there is an infinite set of cyclically 4-edge connected cubic graphs on $n$ vertices with no cycle longer than $c_4 n$ for $c_4=\frac{12}{13}$, and at the same time prove that a certain natural…
Recently, there has been interest in representing single graphs by multiple drawings; for example, using graph stories, storyplans, or uncrossed collections. In this paper, we apply this idea to orthogonal graph drawing. Due to the…
A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges. We show that optimal 1-planar graphs can be recognized in linear time. Our…
In this paper we consider the following problem: is it possible to recover a smooth plane curve of degree at least three from its inflection lines? We answer positively to the posed question for a general smooth plane quartic curve, making…
We automatically verify the crucial steps in the original proof of correctness of an algorithm which, given a geometric graph satisfying certain additional properties removes edges in a systematic way for producing a connected graph in…
A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions…
We prove here that when all planes transverse and nearly perpendicular to the axis of a surface of revolution intersect it in loops having central symmetry, the surface must be quadric. It follows that the quadrics are the only surfaces of…
For each linearly normal elliptic curve $C$ in $\mathbb P^3$, we determine Galois lines and their arrangement. The results are as follows: the curve $C$ has just six $V_4$-lines and in case $j(C)=1$, it has eight $Z_4$-lines in addition.…
We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q.
A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum number of edges of a k-quasi-planar graph with n vertices is…
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.
In a previous paper we classified complete stationary surfaces (i.e. spacelike surfaces with zero mean curvature) in 4-dimensional Lorentz space $\mathbb{R}^4_1$ which are algebraic and with total Gaussian curvature $-\int…
The visual complexity of a graph drawing can be measured by the number of geometric objects used for the representation of its elements. In this paper, we study planar graph drawings where edges are represented by few segments. In such a…
Using symplectic topology and the Radon transform, we prove that smooth 4-dimensional projective planes are diffeomorphic to $\mathbb{CP}^2$. We define the notion of a plane curve in a smooth projective plane, show that plane curves in high…
For planar graphs, we consider the problems of \emph{list edge coloring} and \emph{list total coloring}. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors. Total…
In this paper we have shown without assuming the four color theorem of planar graphs that every (bridgeless) cubic planar graph has a three-edge-coloring. This is an old-conjecture due to Tait in the squeal of efforts in settling the…
A 4-regular planar graph $G$ is said to be circle representable if there exists a collection of circles drawn on the plane such that the touching and crossing points correspond to the vertices of $G$, and the circular arcs between those…
This paper presents a characterization of edge-transitive graphs which are four regular and have girth four. This class consists of four infinite families plus four exceptional graphs.