Low edges in 3-polytopes
From MaRDI portal
Publication:2515562
DOI10.1016/j.disc.2015.05.018zbMath1321.52017OpenAlexW620822798MaRDI QIDQ2515562
Anna O. Ivanova, Oleg V. Borodin
Publication date: 5 August 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.05.018
Related Items (8)
A Steinberg-like approach to describing faces in 3-polytopes ⋮ Light 3-stars in sparse plane graphs ⋮ Another tight description of faces in plane triangulations with minimum degree 4 ⋮ An extension of Kotzig's theorem ⋮ Heights of minor faces in 3-polytopes ⋮ An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations ⋮ Low minor faces in 3-polytopes ⋮ Describing faces in 3-polytopes with no vertices of degree from 5 to 7
Cites Work
- Describing 3-faces in normal plane maps with minimum degree 4
- Describing faces in plane triangulations
- The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5
- The weight of edge in 3-polytopes
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- Triangles with restricted degrees of their boundary vertices in plane triangulations
- Triangulated \(3\)-polytopes without faces of low weight
- Cyclic degrees of 3-polytopes
- Heavy paths, light stars, and big melons
- Light subgraphs of graphs embedded in the plane. A survey
- Colorings of plane graphs: a survey
- Weight of faces in plane maps
- Cyclic coloration of 3-polytopes
- Height of minor faces in plane normal maps
- Unavoidable set of face types for planar maps
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Low edges in 3-polytopes
