Related papers: Enumeration of planar Tangles
Tangential families are 1-parameter families of rays emanating tangentially from smooth curves. We classify tangential family germs up to Left-Right equivalence: we prove that there are two infinite series and four sporadic simple…
The notion of holonomy $R$-matrices is introduced. It is shown how to define invariants of tangles with flat connections in a principle $G$-bundle of the complement of a tangle using holonomy $R$-matrices.
A palintiple is a natural number which is an integer multiple of its digit reversal. A previous paper partitions all palintiples into three distinct classes according to patterns in the carries and then determines all palintiples belonging…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
This paper is a short introduction to the theory of tangles, both in graphs and general connectivity systems. An emphasis is put on the correspondence between tangles of order k and k-connected components. In particular, we prove that there…
We classify endomorphisms of the plane that preserve a pencil of curves.
The Centre Symmetry Set of a planar curve $M$ is the envelope of affine chords of $M$, i.e. the lines joining points on $M$ with parallel tangent lines. In this paper we study global geometrical properties of this set including the number…
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…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…
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.
A planar hypermap with a boundary is defined as a planar map with a boundary, endowed with a proper bicoloring of the inner faces. The boundary is said alternating if the colors of the incident inner faces alternate along its contour. In…
Coloring numbers are one of the simplest combinatorial invariants of knots and links to describe. And with Joyce's introduction of quandles, we can understand them more algebraically. But can we extend these invariants to tangles -- knots…
While knotoids on the sphere are well-understood by a variety of invariants, knotoids on the plane have proven more subtle to classify due to their multitude over knotoids on the sphere and a lack of invariants that detect a diagram's…
A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a planar thrackle drawing of a graph cannot have more edges than vertices, which is equivalent to saying that no…
We study tropically planar graphs, which are the graphs that appear in smooth tropical plane curves. We develop necessary conditions for graphs to be tropically planar, and compute the number of tropically planar graphs up to genus $7$. We…
Let X be a (possibly nodal) K-trivial threefold moving in a fixed ambient space P. Suppose X contains a continuous family of curves, all of whose members satisfy certain unobstructedness conditions in P. A formula is given for computing the…
We study geometric properties of linear strata of uni-singular curves. The singularities of closures of the strata are resolved and the resolutions are represent as projective bundles. This enables to study their geometry. In particular we…
The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count…
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…