Related papers: Empire Maps on Surfaces
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. After the geometric embedding is specified, there is an additional step that is often overlooked or ignored:…
In this work for the first time we enumerate unlabelled maps on orientable genus $g$ surfaces with respect to all homeomorphisms, including both orientation-preserving and orientation-reversing. We show that in the latter case as an…
We consider some problems concerning the maximum number of (strong) dominating sets in a regular graph, and their weighted analogues. Our primary tool is Shearer's entropy lemma. These techniques extend to a reasonably broad class of graph…
This manuscript recounts some of the author's contributions to algebraic and enumerative combinatorics. We have focused on two types of generalizations of bipartite maps, which are bipartite graphs embedded on surfaces. Maps are known to…
The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…
Constellations and hypermaps generalize combinatorial maps, i.e. embedding of graphs in a surface, in terms of factorization of permutations. In this paper, we extend a result of Jackson and Visentin (1990) stating an enumerative relation…
This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…
This paper introduces a new variant of domination-related coloring of graphs, which is a combination of their dominator coloring and equitable coloring called the equitable dominator coloring. An equitable coloring is a proper coloring in…
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interface between the interpretation process and other sources of…
We consider the mathematical theory of geographical maps, with an emphasis on the eighteenth century works of Euler, Lagrange and Delisle. This period is characterized by the frequent use of maps that are no more obtained by the…
We introduce and explore a family of vertex-coloring problems which, surprisingly enough, have not been considered before despite stemming from the problem of Wi-Fi channel assignment. Given a spectrum of colors, endowed with a matrix of…
A technique is developed using patent information available online (at the US Patent and Trademark Office) for the generation of Google Maps. The overlays indicate both the quantity and quality of patents at the city level. This information…
This is the English translation of Leonhard Euler's Latin paper "De solidis quorum superficiem in planum explicare licet". Euler explains several methods to obtain equations for developable surfaces. Therefore, this paper might be…
This article first answers to questions about connectedness of a new family of graphs on unicellular maps. Answering these questions goes through a description of the mapping class group as surgeries on unicellular maps. We also show how…
On a geometrical view, the conception of map geometries are introduced, which is a nice model of the Smarandache geometries, also new kind of and more general intrinsic geometry of surface. Results convinced one that map geometries are…
A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. In this paper, we first give a useful structural theorem for 1-planar graphs, and then apply it to the list edge and list total…
A guaranteed upper bound is proved for the time complexity of the list-coloring problem on graphs.
The construction of the COMBINATORIAL data for a surface with n vertices of maximal genus is a classical problem: The maximal genus g=[(n-3)(n-4)/12] was achieved in the famous ``Map Color Theorem'' by Ringel et al. (1968). We present the…
In the first part, we introduce a notion a degree of edge-colorings of bicubic plane graphs and proves some local formula of the graded number of colorings. In the second part, we give a new proof of a result of Fisk saying that any two…
We define a period map for classical Campedelli surfaces, using a covering trick as in the case of Enriques surfaces: the period map is shown to come from a family of Enriques surfaces, obtained as quotients of the Campedelli surface by an…