A note on nearly Platonic graphs with connectivity one

DOI10.5614/EJGTA.2021.9.1.17MaRDI QIDQ4958059zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

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

zbMATH Keywords

planar graphregular graphplatonic graph

Mathematics Subject Classification ID

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

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.

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

Cites work

• scientific article; zbMATH DE number 7021375 (Why is no real title available?)
• A note on nearly platonic graphs
• Balanced 3-nearly Platonic graphs
• Geometry of chemical graphs. Polycycles and two-faced maps

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)