An efficient genus algorithm based on graph rotations

DOI10.1016/J.DISC.2026.115308MaRDI QIDQ7326043zbMATH OpenFDO

Authors Alexander Metzger, Austin Ulrigg

Publication date 8 September 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115308

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Cites work

• A kuratowski theorem for the projective plane
• A large set of torus obstructions and how they were discovered
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• A practical algorithm for the computation of the genus
• Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen
• Das Geschlecht des vollständigen paaren Graphen
• Errors in graph embedding algorithms
• Graph minors. XIII: The disjoint paths problem
• Graph minors. XX: Wagner's conjecture
• Graphs on surfaces
• On embeddings of circulant graphs
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Stronger ILPs for the Graph Genus Problem.
• Sur le problème des courbes gauches en topologie.
• The genus of the n‐octahedron: Regular cases
• The genus of the Gray graph is 7
• The graph genus problem is NP-complete
• Twelve points in PG (5, 3) with 95040 self-transformations
• Über das Problem der Nachbargebiete.

This page was built for publication: An efficient genus algorithm based on graph rotations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326043)