Generating locally-cyclic triangulations of surfaces

DOI10.1016/0095-8956(92)90015-PzbMath0723.05053DBLPjournals/jct/MalnicM92WikidataQ56504290 ScholiaQ56504290MaRDI QIDQ757398

Bojan Mohar, Aleksander Malnič

Publication date: 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

triangulationssurfacesdouble cycle coverlocally-cyclic graphvertex-splitting

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (9)

Embedding grids in surfaces ⋮ Unnamed Item ⋮ Blocking nonorientability of a surface ⋮ The chromatic number of a graph of girth 5 on a fixed surface ⋮ Irreducible triangulations are small ⋮ Explicit bounds for graph minors ⋮ Constructing the graphs that triangulate both the torus and the Klein bottle ⋮ Long cycles in graphs on a fixed surface ⋮ Covering spaces of locally homogeneous graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Densely embedded graphs
• Embeddings of graphs with no short noncontractible cycles
• Clean triangulations
• Curves von 2-manifolds and isotopies

This page was built for publication: Generating locally-cyclic triangulations of surfaces