Related papers: Partial duality and closed 2-cell embeddings
A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…
Duality of curves is one of the important aspects of the ``classical'' algebraic geometry. In this paper, using this foundation, the duality of tropical polynomials is constructed to introduce the duality of Non-Archimedean curves. Using…
Recently, Gross, Mansour and Tucker introduced the partial-dual genus polynomial of a ribbon graph as a generating function that enumerates the partial duals of the ribbon graph by genus. It is analogous to the extensively-studied…
We introduce and study the problem \mpd, which asks for two planar graphs $G_1$ and $G_2$ whether $G_1$ can be embedded such that its dual is isomorphic to $G_2$. Our algorithmic main result is an NP-completeness proof for the general case…
A rectangular partition is the partition of an (axis-aligned) rectangle into interior-disjoint rectangles. We ask whether a rectangular partition permits a "nice" drawing of its dual, that is, a straight-line embedding of it such that each…
A mixed graph is a graph with undirected and directed edges. Guo and Mohar in 2017 determined all mixed graphs whose Hermitian spectral radii are less than $2$. In this paper, we give a sufficient condition which can make Hermitian spectral…
The notion of regular cell complexes plays a central role in topological combinatorics because of its close relationship with posets. A generalization, called totally normal cellular stratified spaces, was introduced by the third author by…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
In 1965 Edmonds showed that every eulerian graph has a bi-eulerian embedding, i.e., an embedding with exactly two faces, each bounded by an euler circuit. We refine this result by giving conditions for a graph to have a bi-eulerian…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…
A circuit double cover of a bridgeless graph is a collection of even subgraphs such that every edge is contained in exactly two subgraphs of the given collection. Such a circuit double cover describes an embedding of the corresponding graph…
The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…
Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and…
In this paper we introduce the notion of $\Sigma$-colouring of a graph $G$: For given subsets $\Sigma(v)$ of neighbours of $v$, for every $v\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that…
A cusp-decomposable manifold is a manifold constructed from a finite number of complete, negatively curved, finite volume manifolds and identifying the boundaries of truncated cusps by diffeomorphisms. Using properties of the electric space…
We define additional gradings on two generalisations of Khovanov homology (one due to the first author, the other due to the second), and use them to define invariants of various kinds of embeddings. These include invariants of links in…
We define the notion of $(p_0,p_1,\dots,p_d)$-type semi-equivelar gems for closed connected PL $d$-manifolds, related to the regular embedding of gems $\Gamma$ representing $M$ on a surface $S$ such that the face-cycles at all the vertices…
Visual rendering of graphs is a key task in the mapping of complex network data. Although most graph drawing algorithms emphasize aesthetic appeal, certain applications such as travel-time maps place more importance on visualization of…
We consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C. This problem includes, among others, the embeddability problem of a graph on a surface and the…