Joint extension of two theorems of Kotzig on 3-polytopes

DOI10.1007/BF01202794zbMATH Open0777.05050OpenAlexW2044164675MaRDI QIDQ2367448FDOQ2367448

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

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

zbMATH Keywords

boundsplanar mapEuler formulapolytoppe

Mathematics Subject Classification ID

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

Cites Work

• A seven-color theorem on the sphere
• On the total coloring of planar graphs.
• Title not available (Why is that?)

Cited In (33)

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

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)