The Thickness of the Complete Graph

DOI10.4153/CJM-1965-084-2zbMath0135.42104OpenAlexW2322503310MaRDI QIDQ5508786

Frank Harary, Lowell W. Beineke

Publication date: 1965

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1965-084-2

zbMATH Keywords

topology

Related Items (22)

The thickness of amalgamations and Cartesian product of graphs ⋮ Thickness of the subgroup intersection graph of a finite group ⋮ Edge-disjoint maximal planar graphs ⋮ On the thickness and arboricity of a graph ⋮ The thickness of the complete multipartite graphs and the join of graphs ⋮ A tribute to Frank Harary (in honor of his 70th birthday) ⋮ Geometric thickness in a grid ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ On the thickness of graphs of given degree ⋮ Complete colorings of planar graphs ⋮ The complexity of the empire colouring problem ⋮ The thickness of K1,n,n and K2,n,n ⋮ On the planar split thickness of graphs ⋮ The 6-girth-thickness of the complete graph ⋮ Non-planar core reduction of graphs ⋮ A note on the 4-girth-thickness of K_n,n,n ⋮ L'épaisseur du graphe complet de 46 sommets ⋮ Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem ⋮ The thickness of the Kronecker product of graphs ⋮ Remarks on the thickness of a graph ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ The 4-girth-thickness of the complete multipartite graph

This page was built for publication: The Thickness of the Complete Graph