Related papers: Tri-plane diagrams for simple surfaces in $S^4$
A graph is IC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share no common end vertex. IC-planarity specializes both NIC-planarity, which allows a pair of crossing…
In formulating a non-orientable analogue of the Milnor Conjecture on the $4$-genus of torus knots, Batson developed an elegant construction that produces a smooth non-orientable spanning surface in $B^4$ for a given torus knot in $S^3$.…
Plane triangulations with all vertices of degree $3$ or $6$ are enumerated. A plane triangulation is said to be akempic if it has a $4$-colouring such that no two adjacent triangles have the same three colours and this colouring is not…
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. We present upper and lower bounds on the…
For a simple drawing $D$ of the complete graph $K_n$, two (plane) subdrawings are compatible if their union is plane. Let $\mathcal{T}_D$ be the set of all plane spanning trees on $D$ and $\mathcal{F}(\mathcal{T}_D)$ be the compatibility…
Consider a robot that remembers only the starting position and walks along a knot once on a knot diagram, switching every undercrossing it meets until it returns to the starting position. We observe that the robot produces an ascending…
A "book" with k pages consists of a straight line (the "spine") and k half-planes (the "pages"), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine,…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
A zigzag in a map (a $2$-cell embedding of a connected graph in a connected closed $2$-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a…
We exhibit several families of planar graphs that are minor-minimal intrinsically spherical $3$-linked. A graph is intrinsically spherical 3-linked if it is planar graph that has, in every spherical embedding, a non-split 3-link consisting…
Listed as No. 53 among the one hundred famous unsolved problems in [J. A. Bondy, U. S. R. Murty, Graph Theory, Springer, Berlin, 2008] is Steinberg's conjecture, which states that every planar graph without 4- and 5-cycles is 3-colorable.…
In this paper, we prove that the crossing number of circulant graph $C(3k+1;\{1,k\})$ on the projective plane is $k$ for $k \geq 3$.
We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…
Let M be $S^3$, $S^1\times S^2$, or a lens space L(p,q), and let k be a (1,1)-knot in M, i.e., a knot which is of 1-bridge with respect to a Heegaard torus. We show that if there is a closed meridionally incompressible surface in the…
A region crossing change is a local transformation on spatial graph diagrams switching the over/under relations at all the crossings on the boundary of a region. In this paper, we show that a spatial graph of a planar graph is unknottable…
The paper is devoted to relations between topological and metric properties of germs of real surfaces, obtained by analytic maps from $R^2$ to $R^4$. We show that for a big class of such surfaces the normal embedding property implies the…
It has long been known that the quadratic term in the degree of the colored Jones polynomial of a knot is bounded above in terms of the crossing number of the knot. We show that this bound is sharp if and only if the knot is adequate. As an…
We give a list of possibilities for surfaces of general type with $p_g=0$ having an involution $i$ such that the bicanonical map of $S$ is not composed with $i$ and $S/i$ is not rational. Some examples with $K^2=4,...,7$ are constructed as…
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 improve a result by Chodosh and Ketover. We prove that, in an asymptotically flat $3$-manifold $M$ that contains no closed minimal surfaces, fixing $q\in M$ and a $2$-plane $V$ in $T_qM$ there is a properly embedded…