Skewness, crossing number and Euler's bound for graphs on surfaces
Paul C. Kainen

TL;DR
This paper surveys recent developments on inequalities relating skewness, crossing number, and Euler's bound for graphs on surfaces, and presents new results for the folded cube's genus.
Contribution
It introduces new results for the folded cube's genus and discusses the inequalities involving skewness, crossing number, and Euler's bound for graphs on surfaces.
Findings
New bounds for the folded cube's genus.
Survey of recent inequalities for graphs on surfaces.
Extended understanding of skewness and crossing number relations.
Abstract
For every connected graph and surface , we consider the well-known string of inequalities , where and denote skewness and crossing number and is the Euler-formula lower bound. Recent developments are surveyed; new results are given for the ``folded'' cube including its genus.
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
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Data Management and Algorithms
