Pages that link to "Item:Q5508786"

The following pages link to The Thickness of the Complete Graph (Q5508786):

Displaying 22 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)
• Complete colorings of planar graphs (Q1727729) (← links)
• On the planar split thickness of graphs (Q1742373) (← links)
• Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
• Thickness of the subgroup intersection graph of a finite group (Q2146630) (← links)
• The thickness of amalgamations and Cartesian product of graphs (Q2364079) (← links)
• The thickness of the complete multipartite graphs and the join of graphs (Q2410038) (← 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)
• The thickness of K1,n,n and K2,n,n (Q4629553) (← links)
• The 6-girth-thickness of the complete graph (Q4956180) (← links)
• The thickness of the Kronecker product of graphs (Q4988856) (← links)
• The 4-girth-thickness of the complete multipartite graph (Q5009944) (← links)
• A note on the 4-girth-thickness of K_n,n,n (Q5225019) (← links)