THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH
From MaRDI portal
Publication:4159090
DOI10.1070/SM1976v030n02ABEH002267zbMath0381.05034MaRDI QIDQ4159090
V. S. Goncakov, V. B. Alekseev
Publication date: 1978
Published in: Mathematics of the USSR-Sbornik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/sm1976v030n02abeh002267
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
A note on the 4-girth-thickness of K_n,n,n, Straight-line drawings of 1-planar graphs, The thickness of fan-planar graphs is at most three, Thickness and colorability of geometric graphs, Non-planar core reduction of graphs, Thickness and outerthickness for embedded graphs, Thickness of the subgroup intersection graph of a finite group, The thickness of amalgamations and Cartesian product of graphs, The thickness of the complete multipartite graphs and the join of graphs