Edge-disjoint maximal planar graphs (Q1377726): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: R. Jamie Simpson / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Arthur T. White / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Every planar graph with nine points has a nonplanar complement / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Thickness of the Complete Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3344220 / rank | |||
Normal rank | |||
Latest revision as of 10:31, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge-disjoint maximal planar graphs |
scientific article |
Statements
Edge-disjoint maximal planar graphs (English)
0 references
26 January 1998
0 references
\textit{L. W. Beineke} and \textit{F. Harary} [Can. J. Math. 17, 850-859 (1965; Zbl 0135.42104)] showed that there exist \(m\) edge-disjoint maximal planar graphs on a fixed set of \(6m\) vertices. The present authors extend this result to \(n\) vertices, where \(n\geq 6m\). Since the Euler identity disallows \(n< 6m-1\), the only open case is \(n= 6m-1\).
0 references
maximal planar graphs
0 references
