Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
From MaRDI portal
Publication:1649896
DOI10.7151/dmgt.2024zbMath1391.05101OpenAlexW2809765515MaRDI QIDQ1649896
Olesya N. Kazak, Anna O. Ivanova, Oleg V. Borodin
Publication date: 29 June 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2024
Related Items (7)
Light 3-stars in sparse plane graphs ⋮ Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7 ⋮ Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9 ⋮ Minor stars in plane graphs with minimum degree five ⋮ Light minor 5-stars in 3-polytopes with minimum degree 5 ⋮ Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8 ⋮ Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
- Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
- Describing short paths in plane graphs of girth at least 5
- Weight of 3-paths in sparse plane graphs
- 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
- Light subgraphs of graphs embedded in the plane. A survey
- Colorings of plane graphs: a survey
- Note on 3-paths in plane graphs of girth 4
- Joint extension of two theorems of Kotzig on 3-polytopes
- On the existence of specific stars in planar graphs
- 5-stars of low weight in normal plane maps with minimum degree 5
- Minimal vertex degree sum of a 3-path in plane maps
- Short cycles of low weight in normal plane maps with minimum degree 5
- On light subgraphs in plane graphs of minimum degree five
- Paths with restricted degrees of their vertices in planar graphs
This page was built for publication: Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
