Low 5-stars in normal plane maps with minimum degree 5

DOI10.1016/J.DISC.2016.07.013MaRDI QIDQ2374153zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

3-polytopeheightnormal plane mapplane graphstarstructural property

Mathematics Subject Classification ID

Vertex degrees (05C07) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35)

Recommendations

• 5-stars of low weight in normal plane maps with minimum degree 5
• Height of 5-stars in normal plane maps with minimum degree 5
• Light and low 5-stars in normal plane maps with minimum degree 5
• Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
• Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5

Cites work

• 5-stars of low weight in normal plane maps with minimum degree 5
• A structural property of convex 3-polytopes
• Colorings of plane graphs: a survey
• Covering planar graphs with forests
• Describing 3-paths in normal plane maps
• Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
• Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
• Describing short paths in plane graphs of girth at least 5
• scientific article; zbMATH DE number 30974 (Why is no real title available?)
• Joint extension of two theorems of Kotzig on 3-polytopes
• Light and low 5-stars in normal plane maps with minimum degree 5
• Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
• Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
• Light subgraphs of graphs embedded in the plane. A survey
• Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
• Minimal vertex degree sum of a 3-path in plane maps
• Note on 3-paths in plane graphs of girth 4
• Note on an existence of small degree vertices with at most one big degree neighbour in planar graphs
• On light subgraphs in plane graphs of minimum degree five
• On the existence of specific stars in planar graphs
• On the total coloring of planar graphs.
• Paths with restricted degrees of their vertices in planar graphs
• Short cycles of low weight in normal plane maps with minimum degree 5
• Weight of 3-paths in sparse plane graphs

Cited in

(14)

• Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5
• Minor stars in plane graphs with minimum degree five
• Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
• 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
• 5-stars of low weight in normal plane maps with minimum degree 5
• Light 3-stars in sparse plane graphs
• Height of 5-stars in normal plane maps with minimum degree 5
• Light and low 5-stars in normal plane maps with minimum degree 5
• Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
• Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
• On the structure of plane graphs of minimum face size 5
• Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices

This page was built for publication: Low 5-stars in normal plane maps with minimum degree 5

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374153)