Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
From MaRDI portal
(Redirected from Publication:467650)
Recommendations
- 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
- 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
Cites work
- scientific article; zbMATH DE number 4135967 (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 1882356 (Why is no real title available?)
- scientific article; zbMATH DE number 3217679 (Why is no real title available?)
- scientific article; zbMATH DE number 3390789 (Why is no real title available?)
- Colorings of plane graphs: a survey
- Describing 3-faces in normal plane maps with minimum degree 4
- Light subgraphs of graphs embedded in the plane. A survey
- Quelques consequences simples de la formule d'Euler
- Triangles with restricted degrees of their boundary vertices in plane triangulations
- Triangulated \(3\)-polytopes without faces of low weight
Cited in
(6)- Another tight description of faces in plane triangulations with minimum degree 4
- Description of faces in 3-polytopes without vertices of degree from 4 to 9
- Combinatorial structure of faces in triangulations on surfaces
- Tight description of faces in torus triangulations with minimum degree 5
- Describing 3-faces in normal plane maps with minimum degree 4
- Tight description of faces of triangulations on the torus
This page was built for publication: Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467650)
