Zobrazeno 1 - 10
of 21
pro vyhledávání: '"05C10, 05C45"'
Autor:
Gorsky, Maximilian, Kreßin, Fabian
The forcing number of a graph with a perfect matching $M$ is the minimum number of edges in $M$ whose endpoints need to be deleted, such that the remaining graph only has a single perfect matching. This number is of great interest in theoretical chem
Externí odkaz:
http://arxiv.org/abs/2401.17704
The well-known twenty types of 2-uniform tilings of the plane give rise infinitely many doubly semi-equivelar maps on the torus. In this article, we show that every such doubly semi-equivelar map on the torus contains a Hamiltonian cycle. As a conseq
Externí odkaz:
http://arxiv.org/abs/2101.02541
In this paper, we first introduce the notions of checkerboard colourable minors for ribbon graphs motivated by the Eulerian ribbon graph minors, and two kinds of bipartite minors for ribbon graphs, one of which is the dual of the checkerboard coloura
Externí odkaz:
http://arxiv.org/abs/2008.13327
The geometric dual of a cellularly embedded graph is a fundamental concept in graph theory and also appears in many other branches of mathematics. The partial dual is an essential generalization which can be obtained by forming the geometric dual wit
Externí odkaz:
http://arxiv.org/abs/2002.09824
Autor:
Yan, Qi, Jin, Xian'an
In this note we show that any embedded graph has a checkerboard colourable twisted dual and any Eulerian embedded graph has a checkerboard colourable partial Petrial, answering questions posed by Ellis-Monaghan and Moffatt. The proofs are based on or
Externí odkaz:
http://arxiv.org/abs/1808.04047
Autor:
Deng, Qingying, Jin, Xian'an
Huggett and Moffatt characterized all bipartite partial duals of a plane graph in terms of all-crossing directions of its medial graph. Then Metsidik and Jin characterized all Eulerian partial duals of a plane graph in terms of semi-crossing directio
Externí odkaz:
http://arxiv.org/abs/1706.03831
For an integer $k$, a $k$-tree is a tree with maximum degree at most $k$. More generally, if $f$ is an integer-valued function on vertices, an $f$-tree is a tree in which each vertex $v$ has degree at most $f(v)$. Let $c(G)$ denote the number of comp
Externí odkaz:
http://arxiv.org/abs/1704.00246
Autor:
Rus, Jernej
Publikováno v:
Journal of Mathematical Biology, 75(1) (2017), 109-127
In $2013$ a novel self-assembly strategy for polypeptide nanostructure design which could lead to significant developments in biotechnology was presented in [Design of a single-chain polypeptide tetrahedron assembled from coiled-coil segments, Nature
Externí odkaz:
http://arxiv.org/abs/1403.5806
We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily described as a property of the dual graph. Let $G$ be a planar triangulation. Then the dual $G^*$ is a cubic 3-connected planar
Externí odkaz:
http://arxiv.org/abs/1312.3783
Publikováno v:
Journal of Algebra and Its Applications, Vol. 13, No. 7 (2014) 1450040 (18 pages)
There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some properties
Externí odkaz:
http://arxiv.org/abs/1310.2032