Reducing quadrangulations of the sphere and the projective plane
Elke Fuchs, Laura Gellert

TL;DR
This paper demonstrates how quadrangulations of the sphere and projective plane can be simplified through specific graph operations, revealing conditions for t-perfection related to bipartiteness.
Contribution
It introduces a method to reduce quadrangulations to basic graphs using t-contractions and deletions, linking t-perfection to bipartiteness in the projective plane.
Findings
Sphere quadrangulations reduce to 4-cycles
Projective plane quadrangulations reduce to odd wheels
t-perfection characterized by bipartiteness
Abstract
We show that every quadrangulation of the sphere can be transformed into a -cycle by deletions of degree- vertices and by -contractions at degree- vertices. A -contraction simultaneously contracts all incident edges at a vertex with stable neighbourhood. The operation is mainly used in the field of -perfect graphs. We further show that a non-bipartite quadrangulation of the projective plane can be transformed into an odd wheel by -contractions and deletions of degree- vertices. We deduce that a quadrangulation of the projective plane is (strongly) -perfect if and only if the graph is bipartite.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Interconnection Networks and Systems · Cellular Automata and Applications
