On the thickness of the complete graph

DOI10.1090/S0002-9904-1964-11213-1zbMATH Open0123.39903OpenAlexW1974657883MaRDI QIDQ5736733FDOQ5736733

Authors: L. W. Beineke, Frank Harary 

Publication date: 1964

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1964-11213-1

zbMATH Keywords

topology

Cited In (7)

• The 6-girth-thickness of the complete graph
• Complete colorings of planar graphs
• Quasi-planar Graphs
• Graphs with forbidden subgraphs
• The 4-girth-thickness of the complete multipartite graph
• Recent results in topological graph theory
• Orthogonal drawings of graphs for the automation of VLSI circuit design

This page was built for publication: On the thickness of the complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5736733)