THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH

DOI10.1070/SM1976V030N02ABEH002267MaRDI QIDQ4159090zbMATH OpenOpenAlexFDO

Authors V. B. Alekseev, V. S. Goncakov

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

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

Cited in

(14)

• 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
• 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
• Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete
• Thickness and colorability of geometric graphs
• Erratum to: ``The thickness of amalgamations and Cartesian product of graphs and ``The thickness of the Cartesian product of two graphs
• Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete
• The thickness of a graph with constraint on girth
• Thickness of line graph of intersection graph of ideals of rings

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

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