A theorem for the maximum genus of a digraph

DOI10.20142/J.CNKI.AMAS.202401042MaRDI QIDQ6914557zbMATH OpenFDO

Authors Chengliang Zhu, Yi Chao Chen

Publication date 16 October 2025

Published in Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.20142/J.CNKI.AMAS.202401042

zbMATH Keywords

amalgamationEulerian digraphmaximum genus

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites work

• A note on the directed genus of \(K_{n,n,n}\) and \(K_n\)
• An additivity theorem for maximum genus of a graph
• Embedding digraphs on orientable surfaces
• Embedding quartic Eulerian digraphs on the plane
• Enumeration of digraph embeddings
• Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere
• How to determine the maximum genus of a graph
• scientific article; zbMATH DE number 3739583 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)
• scientific article; zbMATH DE number 7535271 (Why is no real title available?)
• The directed genus of the de Bruijn graph
• The genus distributions of 4-regular digraphs
• The genus distributions of directed antiladders in orientable surfaces
• Whitney's theorem for 2-regular planar digraphs

This page was built for publication: A theorem for the maximum genus of a digraph

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