Pages that link to "Item:Q3669439"

The following pages link to Solution of Heawood's empire problem in the plane. (Q3669439):

Displaying 13 items.

• The empire problem in even embeddings on closed surfaces with \(\varepsilon\leq 0\) (Q383759) (← links)
• The complexity of the empire colouring problem for linear forests (Q385396) (← links)
• The complexity of the empire colouring problem (Q476435) (← links)
• Heawood's empire problem (Q1062996) (← links)
• A short solution of Heawood's empire problem in the plane (Q1584437) (← links)
• On the planar split thickness of graphs (Q1742373) (← links)
• The splitting number of the complete graph (Q1821790) (← links)
• Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs (Q2192084) (← links)
• The Empire Problem in Even Embeddings on Closed Surfaces (Q2874086) (← links)
• Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem (Q3104775) (← links)
• Colouring Random Empire Trees (Q3599154) (← links)
• On the Bar Visibility Number of Complete Bipartite Graphs (Q5157389) (← links)
• On the bigenus of the complete graphs (Q5869452) (← links)