Related papers: On planar bipartite biregular degree sequences
A sequence $\left(x_1,x_2,\ldots,x_{2n}\right)$ of even length is a repetition if $\left(x_1,\ldots,x_n\right) = \left(x_{n+1},\ldots,x_{2n}\right)$. We prove existence of a constant $C < 10^{4 \cdot 10^7}$ such that given any planar…
Planar polynomial automorphisms are polynomial maps of the plane whose inverse is also a polynomial map. A map is reversible if it is conjugate to its inverse. Here we obtain a normal form for automorphisms that are reversible by an…
We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…
Two triangles are called orthologic if the perpendiculars from the vertices of one of them to the sides of the other are concurrent. In this paper, we explore the concept of orthology from various points of view. Mostly we work in terms of…
A set $S$ of vertices in a graph $G$ is a paired dominating set if every vertex of $G$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ admits a perfect matching. The minimum cardinality of a paired dominating set of $G$ is…
We characterize pairs of orthogonal countable ordinals. Two ordinals $\alpha$ and $\beta$ are orthogonal if there are two linear orders $A$ and $B$ on the same set $V$ with order types $\alpha$ and $\beta$ respectively such that the only…
In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal ($45^\circ$) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few…
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a k-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily k-connected.
There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The problem of finding such parallelepipeds or proving their non-existence is an old unsolved…
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. If…
We examine connections between the gonality, treewidth, and orientable genus of a graph. Especially, we find that hyperelliptic graphs in the sense of Baker and Norine are planar. We give a notion of a bielliptic graph and show that each of…
There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the sequence. We formulate several novel sufficient graphicality…
A path $P$ in an edge-colored graph $G$ is a \emph{proper path} if no two adjacent edges of $P$ are colored with the same color. The graph $G$ is \emph{proper connected} if, between every pair of vertices, there exists a proper path in $G$.…
A point set $M$ in the Euclidean plane is called a planar integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on a straight line. A planar integral point set is called to be in…
A linear group is called unisingular if every element of it has eigenvalue 1. A certain aspect of the theory of abelian varieties requires the knowledge of unisingular irreducible subgroups of the symplectic groups over the field of two…
The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…
A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…
We show that every bipartite planar graph with minimum degree at least 3 has proper orientation number at most 3.
We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions. We prove that $\Delta-1$…