scientific article; zbMATH DE number 1342018
From MaRDI portal
Publication:4263585
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].
Recommendations
- scientific article; zbMATH DE number 97631
- An inequality concerning edges of minor weight in convex 3-polytopes
- Approximation for minimum triangulations of simplicial convex 3-polytopes
- scientific article; zbMATH DE number 4116561
- Joint extension of two theorems of Kotzig on 3-polytopes
- The weight of edge in 3-polytopes
- Minimal simplicial dissections and triangulations of convex 3-polytopes
- A note on the minimum number of edge-directions of a convex polytope
- Approximating \(3\)-dimensional convex bodies by polytopes with a restricted number of edges
- On the weight of minor faces in triangle-free 3-polytopes
Cited in
(7)- Joint extension of two theorems of Kotzig on 3-polytopes
- An inequality concerning edges of minor weight in convex 3-polytopes
- scientific article; zbMATH DE number 4156458 (Why is no real title available?)
- Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
- scientific article; zbMATH DE number 97631 (Why is no real title available?)
- scientific article; zbMATH DE number 4116561 (Why is no real title available?)
- An introduction to the discharging method via graph coloring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263585)
