Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
From MaRDI portal
Publication:467650
DOI10.1134/S0037446614010030zbMATH Open1302.52012OpenAlexW1994112654MaRDI QIDQ467650FDOQ467650
Authors: Oleg V. Borodin, Anna O. Ivanova 
Publication date: 4 November 2014
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0037446614010030
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
- Colorings of plane graphs: a survey
- Light subgraphs of graphs embedded in the plane. A survey
- Triangles with restricted degrees of their boundary vertices in plane triangulations
- Triangulated \(3\)-polytopes without faces of low weight
- Title not available (Why is that?)
- Describing 3-faces in normal plane maps with minimum degree 4
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quelques consequences simples de la formule d'Euler
Cited In (6)
- Tight description of faces of triangulations on the torus
- Description of faces in 3-polytopes without vertices of degree from 4 to 9
- Describing 3-faces in normal plane maps with minimum degree 4
- Tight description of faces in torus triangulations with minimum degree 5
- Another tight description of faces in plane triangulations with minimum degree 4
- Combinatorial structure of faces in triangulations on surfaces
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)
