Generating locally-cyclic triangulations of surfaces
From MaRDI portal
Publication:757398
DOI10.1016/0095-8956(92)90015-PzbMATH Open0723.05053DBLPjournals/jct/MalnicM92WikidataQ56504290 ScholiaQ56504290MaRDI QIDQ757398FDOQ757398
Authors: Aleksander Malnič, Bojan Mohar 
Publication date: 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Recommendations
- Generating triangulations on closed surfaces with minimum degree at least 4
- On triangulations of surfaces
- Generating 3-connected quadrangulations on surfaces.
- Generating quadrangulations of surfaces with minimum degree at least 3
- scientific article; zbMATH DE number 475596
- Generating punctured surface triangulations with degree at least 4
- Triangulating metric surfaces
- Generating surfaces by refinement of curves
- Decomposition and Enumeration of Triangulated Surfaces
Cites Work
- Title not available (Why is that?)
- Embeddings of graphs with no short noncontractible cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Curves von 2-manifolds and isotopies
- Clean triangulations
- Title not available (Why is that?)
- Densely embedded graphs
Cited In (13)
- Minimal locally cyclic triangulations of the projective plane
- Blocking nonorientability of a surface
- Embedding grids in surfaces
- Title not available (Why is that?)
- Generating even triangulations on the torus
- Explicit bounds for graph minors
- Long cycles in graphs on a fixed surface
- Constructing the graphs that triangulate both the torus and the Klein bottle
- Covering spaces of locally homogeneous graphs
- Irreducible triangulations are small
- The chromatic number of a graph of girth 5 on a fixed surface
- Face-width of embedded graphs
- Generating spherical Eulerian triangulations
This page was built for publication: Generating locally-cyclic triangulations of surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757398)
