Pages that link to "Item:Q5508786"
From MaRDI portal
The following pages link to The Thickness of the Complete Graph (Q5508786):
Displayed 12 items.
- The complexity of the empire colouring problem (Q476435) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- On the thickness and arboricity of a graph (Q1121907) (← links)
- On the thickness of graphs of given degree (Q1174334) (← links)
- Remarks on the thickness of a graph (Q1292575) (← links)
- Edge-disjoint maximal planar graphs (Q1377726) (← links)
- A tribute to Frank Harary (in honor of his 70th birthday) (Q1388964) (← links)
- Geometric thickness in a grid (Q1417581) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- L'épaisseur du graphe complet de 46 sommets (Q2546206) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem (Q3104775) (← links)