Description of faces in 3-polytopes without vertices of degree from 4 to 9

zbMATH Open1399.05047MaRDI QIDQ4635440FDOQ4635440

Authors: Anna O. Ivanova 

Publication date: 20 April 2018

Full work available at URL: http://mathnet.ru/eng/svfu/v23/i3/p46

Recommendations

• Describing 3-faces in normal plane maps with minimum degree 4
• Describing faces in 3-polytopes with no vertices of degree from 5 to 7
• Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
• Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
• Describing faces in plane triangulations

zbMATH Keywords

weightplanar graph3-polytopeplane mapstructure properties

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Three-dimensional polytopes (52B10) Structural characterization of families of graphs (05C75)

Cited In (8)

• Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
• An Eberhard-like theorem for pentagons and heptagons
• Title not available (Why is that?)
• Describing 3-faces in normal plane maps with minimum degree 4
• Describing faces in 3-polytopes with no vertices of degree from 5 to 7
• A Steinberg-like approach to describing faces in 3-polytopes
• On the faces of unigraphic 3-polytopes
• An inequality for 3-polytopes

This page was built for publication: Description of faces in 3-polytopes without vertices of degree from 4 to 9

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