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

DOI10.1007/S00373-016-1743-6MaRDI QIDQ2361077zbMATH OpenOpenAlexFDO

Authors 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

3-polytopeface typeminor faceplane graphplane mapstructural properties

Mathematics Subject Classification ID

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

Recommendations

• Describing faces in 3-polytopes with no vertices of degree from 5 to 7
• Description of faces in 3-polytopes without vertices of degree from 4 to 9
• Another tight description of faces in plane triangulations with minimum degree 4
• Describing 3-faces in normal plane maps with minimum degree 4
• Describing faces in plane triangulations

Cites work

• A note on the three color problem
• Colorings of plane graphs: a survey
• Describing 3-faces in normal plane maps with minimum degree 4
• Describing faces in plane triangulations
• Height of minor faces in plane normal maps
• Heights of minor faces in triangle-free 3-polytopes
• scientific article; zbMATH DE number 434910 (Why is no real title available?)
• scientific article; zbMATH DE number 4218321 (Why is no real title available?)
• scientific article; zbMATH DE number 4135967 (Why is no real title available?)
• scientific article; zbMATH DE number 54790 (Why is no real title available?)
• scientific article; zbMATH DE number 58093 (Why is no real title available?)
• scientific article; zbMATH DE number 3504992 (Why is no real title available?)
• scientific article; zbMATH DE number 3217679 (Why is no real title available?)
• scientific article; zbMATH DE number 3310750 (Why is no real title available?)
• scientific article; zbMATH DE number 3390789 (Why is no real title available?)
• Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
• Light subgraphs of graphs embedded in the plane. A survey
• Low edges in 3-polytopes
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Quelques consequences simples de la formule d'Euler
• Steinberg's conjecture is false
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• Triangles with restricted degrees of their boundary vertices in plane triangulations
• Triangulated \(3\)-polytopes without faces of low weight
• Unavoidable set of face types for planar maps
• Weight of faces in plane maps

Cited in

(7)

• 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
• Describing 3-faces in normal plane maps with minimum degree 4
• Describing faces in plane triangulations
• Light 3-faces in 3-polytopes without adjacent triangles
• All tight descriptions of faces in plane triangulations with minimum degree 4
• Describing 3-faces in 3-polytopes without adjacent triangles

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

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