Year: 2024
Type: article
Abstract: For each surface besides the sphere, projective plane, and Klein bottle, we construct a face‐simple minimal quadrangulation, that is, a simple quadrangulation on the fewest number of vertices possible, whose dual is also a simple graph. Our result answers a question of Liu, Ellingham, and Ye while providing a simpler proof of their main result. The inductive construction is based on an earlier idea for finding near‐quadrangular embeddings of the complete graphs using the diamond sum operation.
Source: Journal of Graph Theory
DOI: 10.1002/jgt.23198
Authors: Sarah Abusaif, Warren Singh, Timothy Sun
Institution: San Francisco State University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4403806607