Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Sulanke, Thom"'
Autor:
Sulanke, Thom
We describe procedures for generating all 2-cell embedded simple graphs with up to a fixed number of vertices on a given surface. We also modify these procedures to generate closed 2-cell embeddings and polyhedral embeddings. We give results of compu
Externí odkaz:
http://arxiv.org/abs/1509.06412
Autor:
Sulanke, Thom
This note adds one diminimal map on the torus to the published set of 55. It also raises to 15 the number of vertices for which all diminimal maps on the torus are known.
Comment: 6 pages, 4 figure
Comment: 6 pages, 4 figure
Externí odkaz:
http://arxiv.org/abs/1408.0428
We survey basic properties and bounds for $q$-equivelar and $d$-covered triangulations of closed surfaces. Included in the survey is a list of the known sources for $q$-equivelar and $d$-covered triangulations. We identify all orientable and non-orie
Externí odkaz:
http://arxiv.org/abs/1001.2777
Publikováno v:
European J. Combinatorics 32.8:1244-1252, 2011
This paper studies the following question: Given a surface $\Sigma$ and an integer $n$, what is the maximum number of cliques in an $n$-vertex graph embeddable in $\Sigma$? We characterise the extremal graphs for this question, and prove that the ans
Externí odkaz:
http://arxiv.org/abs/0906.4142
In 1970, Walkup completely described the set of $f$-vectors for the four 3-manifolds $S^3$, $S^2 twist S^1$, $S^2 \times S^1$, and $RP^3$. We improve one of Walkup's main restricting inequalities on the set of $f$-vectors of 3-manifolds. As a consequ
Externí odkaz:
http://arxiv.org/abs/0805.1144
Autor:
Sulanke, Thom, Lutz, Frank H.
We present a fast enumeration algorithm for combinatorial 2- and 3-manifolds. In particular, we enumerate all triangulated surfaces with 11 and 12 vertices and all triangulated 3-manifolds with 11 vertices. We further determine all equivelar polyhedr
Externí odkaz:
http://arxiv.org/abs/math/0610022
Autor:
Sulanke, Thom
Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined for the su
Externí odkaz:
http://arxiv.org/abs/math/0606687
Autor:
Sulanke, Thom
The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of these irredu
Externí odkaz:
http://arxiv.org/abs/math/0606690
Autor:
Sulanke, Thom
Publikováno v:
J. Combin. Theory, Ser. B 96 (6) (2006) 964-972
We give the complete list of the 29 irreducible triangulations of the Klein bottle. We show how the construction of Lawrencenko and Negami, which listed only 25 such irreducible triangulations, can be modified at two points to produce the 4 additiona
Externí odkaz:
http://arxiv.org/abs/math/0407008
Publikováno v:
In European Journal of Combinatorics November 2011 32(8):1244-1252
