English
Related papers

Related papers: Semi-equivelar toroidal maps and their k-edge cove…

200 papers

In this letter we proved this theorem: \emph{if $F$ be a holomorphic mapping of $T_{\Omega}$ to a mapping manifold $X$ such that for every compact subset $K\subset \Omega$ the mapping $F$ is uniformly continues on $T_{K}$ and $F(T_{K})$ is…

Classical Analysis and ODEs · Mathematics 2010-11-29 Ali Reza Khatoon Abadi , H. R. Rezazadeh , F. Golgoii

A graph is called {\em half-arc-transitive} if its full automorphism group acts transitively on vertices and edges, but not on arcs. It is well known that for any prime $p$ there is no tetravalent half-arc-transitive graph of order $p$ or…

Combinatorics · Mathematics 2016-05-27 Yi Wang , Yan-Quan Feng

A multigraph drawn in the plane is non-homotopic if no two edges connecting the same pair of vertices can be continuously deformed into each other without passing through a vertex, and is $k$-crossing if every pair of edges…

Combinatorics · Mathematics 2024-01-22 António Girão , Freddie Illingworth , Alex Scott , David R. Wood

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…

Combinatorics · Mathematics 2022-11-28 Niranjan Balachandran , Anish Hebbar

The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. One of the most studied types of drawings in this area are the…

We study edge-to-edge tilings of the sphere by edge congruent pentagons, under the assumption that there are tiles with all vertices having degree 3. We develop the technique of neighborhood tilings and apply the technique to completely…

Metric Geometry · Mathematics 2013-04-16 Ka Yue Cheuk , Ho Man Cheung , Min Yan

An Euler tour in a hypergraph (also called a rank-2 universal cycle or 1-overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this paper, we define a covering $k$-hypergraph to be a non-empty…

Combinatorics · Mathematics 2021-01-13 Mateja Šajna , Andrew Wagner

Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…

Information Theory · Computer Science 2021-03-11 Virgilio P. Sison , Charles R. Repizo

An edge-girth-regular graph $egr(n,k,g,\lambda)$ is a $k-$regular graph of order $n$, girth $g$ and with the property that each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. We present new families of edge-girth…

Combinatorics · Mathematics 2023-05-29 István Porupsánszki

In this article we give an explicit classification for the countably infinite graphs $\mathcal{G}$ which are, for some $k$, $\geq$$ k$-homogeneous. It turns out that a $\geq$$k-$homogeneous graph $\mathcal{M}$ is non-homogeneous if and only…

Combinatorics · Mathematics 2018-01-08 Ove Ahlman

A toric origami manifold is a generalization of a symplectic toric manifold (or a toric symplectic manifold). The origami symplectic form is allowed to degenerate in a good controllable way in contrast to the usual symplectic form. It is…

Algebraic Topology · Mathematics 2017-09-15 Anton Ayzenberg , Mikiya Masuda , Seonjeong Park , Haozhi Zeng

In this paper we give a classification of tilings of the sphere by congruent quadrilaterals with exactly two equal edges. The tilings are the earth map tilings, $(p,q)$-earth map tilings and their flip modifications, and quadrilateral…

Combinatorics · Mathematics 2021-09-06 Ho Man Cheung , Hoi Ping Luk

Density-equalizing map is a shape deformation technique originally developed for cartogram creation and sociological data visualization on planar geographical maps. In recent years, there has been an increasing interest in developing…

Graphics · Computer Science 2025-11-18 Shunyu Yao , Gary P. T. Choi

In this paper we give a complete description about normal monohedral tilings of a convex disc with smooth boundary where we have at most three topological discs as tiles. This result is a far-reaching generalization of the results of…

Metric Geometry · Mathematics 2021-10-25 Kinga Nagy , Viktor Vigh

An Euler tour in a hypergraph $H$ is a closed walk that traverses each edge of $H$ exactly once, and an Euler family is a family of closed walks that jointly traverse each edge of $H$ exactly once. An $\ell$-covering $k$-hypergraph, for $2…

Combinatorics · Mathematics 2021-01-28 Mateja Šajna , Andrew Wagner

A $triangulation$ is an embedding of a graph on surfaces where every face has length three. In this article, we show the existence of contractible Hamiltonian cycle in triangulated maps of which minimum degree is four.

Combinatorics · Mathematics 2014-07-14 Dipendu Maity , Ashish Kumar Upadhyay

A graph $G$ is $k$-edge-Hamiltonian if any collection of vertex-disjoint paths with at most $k$ edges altogether belong to a Hamiltonian cycle in $G$. A graph $G$ is $k$-Hamiltonian if for all $S\subseteq V(G)$ with $|S|\le k$, the subgraph…

Combinatorics · Mathematics 2024-04-09 Yongtao Li , Yuejian Peng

We show that there is a type-preserving homomorphism from the fundamental group of the figure-eight knot complement to the mapping class group of the thrice-punctured torus. As a corollary, we obtain infinitely many commensurability classes…

Geometric Topology · Mathematics 2026-05-04 Autumn E. Kent , Christopher J. Leininger

A map is a partition of the sphere into regions that are labeled as countries or holes. The vertices of a map graph are the countries of a map. There is an edge if and only if the countries are adjacent and meet in at least one point. For a…

Computational Geometry · Computer Science 2023-08-23 Franz J. Brandenburg

A geometric graph is a drawing of a graph in the plane where the vertices are drawn as points in general position and the edges as straight-line segments connecting their endpoints. It is plane if it contains no crossing edges. We study…

Computational Geometry · Computer Science 2025-06-26 Marco Ricci , Jonathan Rollin , André Schulz , Alexandra Weinberger
‹ Prev 1 3 4 5 6 7 10 Next ›