Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-18T08:48:59.948Z Has data issue: false hasContentIssue false

The Thickness of the Complete Graph

Published online by Cambridge University Press:  20 November 2018

Lowell W. Beineke
Affiliation:
The University of Michigan
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1965