Cubic graphs and related triangulations on orientable surfaces

Wenjie Fang, Mihyun Kang, Michael Moßhammer, Philipp Sprüssel

Research output: Contribution to journalArticlepeer-review


Let Sg be the orientable surface of genus g for a fixed non-negative integer g. We show that the number of vertex-labelled cubic multigraphs embeddable on Sg with 2n vertices is asymptotically cgn5/2(g−1)−1γ2n(2n)!, where γ is an algebraic constant and cg is a constant depending only on the genus g. We also derive an analogous result for simple cubic graphs and weighted cubic multigraphs. Additionally, for g≥1, we prove that a typical cubic multigraph embeddable on Sg has exactly one non-planar component.
Original languageEnglish
Article numberP1.30
Number of pages52
JournalThe Electronic Journal of Combinatorics
Issue number1
Publication statusPublished - 2018

Fields of Expertise

  • Information, Communication & Computing


Dive into the research topics of 'Cubic graphs and related triangulations on orientable surfaces'. Together they form a unique fingerprint.

Cite this