Planar graphs with few vertices of small degree

DOI10.1016/0012-365X(94)00028-HzbMath0830.05022OpenAlexW2072063591MaRDI QIDQ1897428

Jerrold R. Griggs, Yan-Chyuan Lin

Publication date: 28 January 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00028-h

zbMATH Keywords

planar graphsEuler formulavertex degrees

Mathematics Subject Classification ID

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

Related Items (2)

Planar graphs with few vertices of small degree ⋮ The maximum sum of degrees above a threshold in planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A batching method for coloring planar graphs
• Planar graphs with few vertices of small degree
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra

This page was built for publication: Planar graphs with few vertices of small degree