The Thickness of the Complete Graph
- 1 January 1965
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 17, 850-859
- https://doi.org/10.4153/cjm-1965-084-2
Abstract
A graph G consists of a finite set of p points and q lines joining pairs of these points. Each line joins two distinct points and no pair of points is joined by more than one line. A subgraph of G is a graph whose points and lines are also in G. If every pair of points of a graph is joined by a line, the graph is called complete and is denoted by Kp. A planar graph can be embedded in the plane, that is, drawn in the plane in such a way that none of its lines intersect.Keywords
This publication has 7 references indexed in Scilit:
- Inequalities involving the genus of a graph and its thicknessesProceedings of the Glasgow Mathematical Association, 1965
- Die toroidale Dicke des vollständigen GraphenMathematische Zeitschrift, 1965
- Recent results in topological graph theoryActa Mathematica Hungarica, 1964
- On the thickness of the complete graphBulletin of the American Mathematical Society, 1964
- The Non-Biplanar Character of the Complete 9-GraphCanadian Mathematical Bulletin, 1963
- Every planar graph with nine points has a nonplanar complementBulletin of the American Mathematical Society, 1962
- Sur le problème des courbes gauches en TopologieFundamenta Mathematicae, 1930