A Steinberg-like approach to describing faces in 3-polytopes

DOI10.1007/s00373-016-1743-6zbMath1365.05058OpenAlexW2560819437MaRDI QIDQ2361077

Oleg V. Borodin, Anna O. Ivanova, Ekaterina I. Vasil'eva

Publication date: 29 June 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1743-6

zbMATH Keywords

plane graph3-polytopeplane mapstructural propertiesminor faceface type

Mathematics Subject Classification ID

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

Related Items (max. 100)

Another tight description of faces in plane triangulations with minimum degree 4 ⋮ Describing faces in 3-polytopes with no vertices of degree from 5 to 7

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• Describing 3-faces in normal plane maps with minimum degree 4
• Describing faces in plane triangulations
• Triangles with restricted degrees of their boundary vertices in plane triangulations
• Triangulated \(3\)-polytopes without faces of low weight
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• Light subgraphs of graphs embedded in the plane. A survey
• Colorings of plane graphs: a survey
• Weight of faces in plane maps
• Low edges in 3-polytopes
• Quelques consequences simples de la formule d'Euler
• 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
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• Heights of minor faces in triangle-free 3-polytopes

This page was built for publication: A Steinberg-like approach to describing faces in 3-polytopes