Minimal quadrangulations of surfaces

Abstract

A quadrangular embedding of a graph in a surface , also known as a quadrangulation of , is a cellular embedding in which every face is bounded by a 4-cycle. A quadrangulation of is minimal if there is no quadrangular embedding of a (simple) graph of smaller order in . In this paper we determine n(), the order of a minimal quadrangulation of a surface , for all surfaces, both orientable and nonorientable. Letting S0 denote the sphere and N2 the Klein bottle, we prove that n(S0)=4, n(N2)=6, and n()= (5+25-16())/2 for all other surfaces , where () is the Euler characteristic. Our proofs use a `diagonal technique', introduced by Hartsfield in 1994. We explain the general features of this method.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…