Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\)

DOI10.1007/S00373-010-0969-YzbMath1235.05068OpenAlexW2082110194MaRDI QIDQ659679

Han Ren, Yanbo Gao

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0969-y

zbMATH Keywords

graceful labelingcurrent graphmaximum orientable genus embedding (MGE)optimal tree

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Total embedding distributions of Ringel ladders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Region distributions of some small diameter graphs
• On the number of maximum genus embeddings of almost all graphs
• How to determine the maximum genus of a graph
• A note on the number of graceful labellings of paths
• Triangular embeddings of complete graphs from graceful labellings of paths
• The graph genus problem is NP-complete
• A new characterization of the maximum genus of a graph

This page was built for publication: Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\)