Pages that link to "Item:Q1193548"

The following pages link to On the number of maximum genus embeddings of almost all graphs (Q1193548):

Displaying 11 items.

• Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) (Q659679) (← links)
• Number of embeddings of circular and Möbius ladders on surfaces (Q989772) (← links)
• The maximum genus of graphs with diameter three (Q1297478) (← links)
• Maximum genus of strong embeddings (Q1432858) (← links)
• Maximum genus embeddings of Steiner triple systems (Q1767628) (← links)
• Maximum genus of a graph in terms of its embedding properties. (Q1868846) (← links)
• A tight lower bound on the maximum genus of a simplicial graph (Q1923508) (← links)
• Exponentially many genus embeddings of the complete graph \(K_{12s+3}\) (Q2355353) (← links)
• Enumerating the orientable 2-cell imbeddings of complete bipartite graphs (Q4229262) (← links)
• Genus g Graphs Have Pagenumber O(√g) (Q4304062) (← links)
• MAXIMUM GENUS EMBEDDINGS OF LATIN SQUARES (Q4636396) (← links)