Generating all triangulations of plane graphs

DOI10.7155/JGAA.00234MaRDI QIDQ2865036zbMATH OpenOpenAlexFDO

Authors Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano

Publication date 28 November 2013

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00234

zbMATH Keywords

cyclegenealogical treeplane graphtriangulation

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Generating All Triangulations of Plane Graphs (Extended Abstract)
• Efficient generation of triconnected plane triangulations.
• scientific article; zbMATH DE number 1796961
• An efficient algorithm for enumeration of triangulations
• Graph Drawing

Cited in

(7)

• Efficient generation of triconnected plane triangulations.
• Generating All Triangulations of Plane Graphs (Extended Abstract)
• scientific article; zbMATH DE number 1754610 (Why is no real title available?)
• Generating weakly triangulated graphs
• Lower bounds on the dilation of plane spanners
• Lower bounds on the dilation of plane spanners
• Family Trees for Enumeration

This page was built for publication: Generating all triangulations of plane graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865036)