Low 5-stars in normal plane maps with minimum degree 5
From MaRDI portal
Publication:2374153
DOI10.1016/j.disc.2016.07.013zbMath1351.05056OpenAlexW2507962803MaRDI QIDQ2374153
Oleg V. Borodin, Anna O. Ivanova
Publication date: 14 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.07.013
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)
Related Items
Light 3-stars in sparse plane graphs, Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5, Soft 3-stars in sparse plane graphs, 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
- 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 3-paths in normal plane maps
- Describing short paths in plane graphs of girth at least 5
- Weight of 3-paths in sparse plane graphs
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-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
- Covering planar graphs with forests
- 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
- On the total coloring of planar graphs.
- 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
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- Paths with restricted degrees of their vertices in planar graphs
