Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices

DOI10.1016/j.disc.2015.10.018zbMath1327.05072OpenAlexW2201541097MaRDI QIDQ898158

Oleg V. Borodin, Anna O. Ivanova

Publication date: 8 December 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.10.018

zbMATH Keywords

heightplane graphweightstar3-polytopeplane mapstructural property

Mathematics Subject Classification ID

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

Related Items

Low 5-stars in normal plane maps with minimum degree 5, Light 3-stars in sparse plane graphs, On the structure of essentially-highly-connected polyhedral graphs, Minor stars in plane graphs with minimum degree five

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• 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
• 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
• Coloring the square of a planar graph