THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH

DOI10.1070/SM1976v030n02ABEH002267zbMath0381.05034OpenAlexW2052682700MaRDI 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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (9)

The thickness of amalgamations and Cartesian product of graphs ⋮ Thickness of the subgroup intersection graph of a finite group ⋮ The thickness of the complete multipartite graphs and the join of graphs ⋮ Straight-line drawings of 1-planar graphs ⋮ The thickness of fan-planar graphs is at most three ⋮ Thickness and outerthickness for embedded graphs ⋮ Thickness and colorability of geometric graphs ⋮ Non-planar core reduction of graphs ⋮ A note on the 4-girth-thickness of K_n,n,n

This page was built for publication: THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH