A note on nearly Platonic graphs with connectivity one

DOI10.5614/EJGTA.2021.9.1.17zbMATH Open1468.05037arXiv1911.05135OpenAlexW3158150644MaRDI QIDQ4958059FDOQ4958059

Authors: Dalibor Fronček, Mahdi Reza Khorsandi, Seyed Reza Musawi, J. Qiu 

Publication date: 6 September 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Abstract: A k-regular planar graph G is nearly Platonic when all faces but one are of the same degree while the remaining face is of a different degree. We show that no such graphs with connectivity one can exist. This complements a recent result by Keith, Froncek, and Kreher on non-existence of 2-connected nearly Platonic graphs.

Full work available at URL: https://arxiv.org/abs/1911.05135

Recommendations

• A note on nearly platonic graphs
• On families of 2-nearly Platonic graphs
• Balanced 3-nearly Platonic graphs
• scientific article; zbMATH DE number 2235055
• Finite platonic graphs

zbMATH Keywords

planar graphregular graphplatonic graph

Mathematics Subject Classification ID

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

Cites Work

• Geometry of chemical graphs. Polycycles and two-faced maps
• A note on nearly platonic graphs
• Title not available (Why is that?)
• Balanced 3-nearly Platonic graphs

Cited In (3)

• Balanced 3-nearly Platonic graphs
• A note on nearly platonic graphs
• On families of 2-nearly Platonic graphs

This page was built for publication: A note on nearly Platonic graphs with connectivity one

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