Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5
DOI10.1134/S0037446618010056zbMATH Open1390.05047OpenAlexW2792034942WikidataQ130133508 ScholiaQ130133508MaRDI QIDQ1642298FDOQ1642298
Authors: Oleg V. Borodin, Anna O. Ivanova, Dmitrii Vladislavovich Nikiforov 
Publication date: 20 June 2018
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0037446618010056
Recommendations
- Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
- 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
- Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9
- Light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52B99)
Cites Work
- Colorings of plane graphs: a survey
- 5-stars of low weight in normal plane maps with minimum degree 5
- An analogue of Franklin's theorem
- Title not available (Why is that?)
- Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
- Title not available (Why is that?)
- Short cycles of low weight in normal plane maps with minimum degree 5
- On light subgraphs in plane graphs of minimum degree five
- Title not available (Why is that?)
- Title not available (Why is that?)
- Low 5-stars in normal plane maps with minimum degree 5
- Quelques consequences simples de la formule d'Euler
- Light and low 5-stars in normal plane maps with minimum degree 5
- Note on an existence of small degree vertices with at most one big degree neighbour in planar graphs
- Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
- Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7
- On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
- Light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
- The structure of the neighborhoods of 5-vertices in plane triangulations with minimum degree 5
- The structure of neighborhoods of 5-vertices in normal plane maps with minimum degree 5
Cited In (9)
- Soft 3-stars in sparse plane graphs
- Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
- Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8
- Light 3-stars in sparse plane graphs
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15
- The structure of the neighborhoods of 5-vertices in plane triangulations with minimum degree 5
- Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
- Minor stars in plane graphs with minimum degree five
This page was built for publication: Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1642298)
