Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann
From MaRDI portal
Publication:766541
Cites work
Cited in
(32)- Locally Hamiltonian graphs and minimal size of maximal graphs on a surface
- On the maximum number of cliques in a graph embedded in a surface
- Degree-regular triangulations of torus and Klein bottle
- Enumerative properties of triangulations of spherical bundles over \(S^1\)
- Diagonal flips in triangulations of surfaces
- A minimum-vertex triangulation
- Minimal quadrangulations of nonorientable surfaces
- Non-existence of polyhedral immersions of triangulated surfaces in \(\mathbb R^3\)
- The covering type of closed surfaces and minimal triangulations
- The weakly neighborly polyhedral maps on the 2-manifold with Euler characteristic -1
- Topology of random 2-complexes
- Enriched homology and cohomology modules of simplicial complexes
- A construction principle for tight and minimal triangulations of manifolds
- Simplicial complexity of surface groups
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- Socles of Buchsbaum modules, complexes and posets
- A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\)
- Edge‐maximal graphs on orientable and some nonorientable surfaces
- Minimal quadrangulations of surfaces
- Generalized Heawood numbers
- Face numbers: the upper bound side of the story
- On the chromatic number of skew graphs
- Two-dimensional weak pseudomanifolds on eight vertices
- Minimal triangulations on orientable surfaces
- Coloring face hypergraphs on surfaces
- Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds
- Stacked polytopes and tight triangulations of manifolds
- Degree-regular triangulations of the double-torus
- Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs
- Constructing the graphs that triangulate both the torus and the Klein bottle
- Minimal triangulations of two-dimensional manifolds
- Clean triangulations
This page was built for publication: Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766541)
