Joint extension of two theorems of Kotzig on 3-polytopes

DOI10.1007/BF01202794MaRDI QIDQ2367448zbMATH OpenOpenAlexFDO

Authors Oleg V. Borodin

Publication date 16 August 1993

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01202794

zbMATH Keywords

boundsEuler formulaplanar mappolytoppe

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Review text

By a 3-polytope is meant a planar map whose underlying graph is 3- connected. The weight of an edge is defined to be the sum of the degrees of its two ends. This paper provides that each 3-polytope has either an edge of weight at most 13 for which both incident faces are triangles, or an edge of weight at most 10 which is incident with a triangle, or else an edge of weight at most 8. All the bounds are shown to be sharp.

Recommendations

• scientific article; zbMATH DE number 97631
• scientific article; zbMATH DE number 1342018
• The vertex-face weight of edges in 3-polytopes
• scientific article; zbMATH DE number 30974
• Weight of edges in normal plane maps

Cites work

• A seven-color theorem on the sphere
• scientific article; zbMATH DE number 3217679 (Why is no real title available?)
• On the total coloring of planar graphs.

Cited in

(35)

• Lightness of digraphs in surfaces and directed game chromatic number
• 5-connected 3-polytopes are refinements of octahedra
• Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
• All tight descriptions of 3-paths in plane graphs with girth at least 9
• Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
• Weight of faces in plane maps
• All tight descriptions of 3-paths in plane graphs with girth 8
• All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
• Describing tight descriptions of 3-paths in triangle-free normal plane maps
• Low 5-stars in normal plane maps with minimum degree 5
• Refined weight of edges in normal plane maps
• Deeply asymmetric planar graphs
• Light 3-stars in sparse plane graphs
• All tight descriptions of 3-paths in plane graphs with girth at least 7
• Weight of edges in normal plane maps
• An inequality concerning edges of minor weight in convex 3-polytopes
• An extension of Kotzig's theorem
• Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
• On doubly light triangles in plane graphs
• Describing 3-paths in normal plane maps
• scientific article; zbMATH DE number 30974 (Why is no real title available?)
• scientific article; zbMATH DE number 97631 (Why is no real title available?)
• scientific article; zbMATH DE number 1342018 (Why is no real title available?)
• scientific article; zbMATH DE number 4116561 (Why is no real title available?)
• Paths with restricted degrees of their vertices in planar graphs
• Tight descriptions of 3-paths in normal plane maps
• Light 3-paths in 3-polytopes without adjacent triangles
• Light 3-faces in 3-polytopes without adjacent triangles
• Describing edges in normal plane maps having no adjacent 3-faces
• Description of edges incident to 3-faces in 3-polytopes without adjacent 3-faces
• On the weight of minor faces in triangle-free 3-polytopes
• Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
• Weight of 3-paths in sparse plane graphs
• Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
• The vertex-face weight of edges in 3-polytopes

This page was built for publication: Joint extension of two theorems of Kotzig on 3-polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367448)