No label defined (Q4263585)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1342018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1342018 |
Statements
18 June 2000
0 references
convex 3-polytope
0 references
planar graph
0 references
light edge
0 references
charge function
0 references
0.92246413
0 references
0.8690939
0 references
0.86608756
0 references
0 references
0.86330277
0 references
0.8620992
0 references
0.86145896
0 references
0.85990524
0 references
The author gives a short proof to the following theorem: ``Every 3-connected planar graph contains a \((3,a)\)-edge, \(3\leq a\leq 10\), or a \((4,b)\)-edge, \(4\leq b\leq 7\), or a \((5,c)\)-edge, \(5\leq c\leq 6\). The bounds 10, 7, and 6 are the best possible.'' Here an edge of a graph is called a \((i,j)\)-edge if its endvertices are of degrees \(i\) and \(j\). For the entire collection see [Zbl 0914.00058].
0 references
