Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8
From MaRDI portal
Publication:2319728
DOI10.1016/j.disc.2019.05.010zbMath1418.05057OpenAlexW2947366088WikidataQ127811757 ScholiaQ127811757MaRDI QIDQ2319728
Oleg V. Borodin, Anna O. Ivanova, Olesya N. Kazak
Publication date: 20 August 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.05.010
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analogue of Franklin's theorem
- Light and low 5-stars in normal plane maps with minimum degree 5
- Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
- Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- A structural property of convex 3-polytopes
- Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
- Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices
- Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7
- Light subgraphs of graphs embedded in the plane. A survey
- On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
- Low 5-stars in normal plane maps with minimum degree 5
- On the existence of specific stars in planar graphs
- 5-stars of low weight in normal plane maps with minimum degree 5
- Short cycles of low weight in normal plane maps with minimum degree 5
- On light subgraphs in plane graphs of minimum degree five
This page was built for publication: Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8
