Checkerboard colourable twisted duals
Qi Yan, Xian'an Jin

TL;DR
This paper proves that every embedded graph has a checkerboard colourable twisted dual, and Eulerian embedded graphs have checkerboard colourable partial Petrials, using orientations of medial graphs and ribbon graph boundary components.
Contribution
It provides new proofs that every embedded graph has a checkerboard colourable twisted dual and Eulerian graphs have checkerboard colourable partial Petrials, answering prior open questions.
Findings
Every embedded graph has a checkerboard colourable twisted dual.
Eulerian embedded graphs have a checkerboard colourable partial Petrial.
Proofs utilize orientations of medial graphs and boundary components of ribbon graphs.
Abstract
In this note we show that any embedded graph has a checkerboard colourable twisted dual and any Eulerian embedded graph has a checkerboard colourable partial Petrial, answering questions posed by Ellis-Monaghan and Moffatt. The proofs are based on orientations of their medial graphs and orientations of boundary components of their corresponding ribbon graphs. The arrow presentations of ribbon graphs are also used. We also obtain two related results.
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 Materials and Mechanics
