Absence of 1-Nearly Platonic Graphs
Abstract
A t-nearly platonic graph is a finite, connected, regular, simple and planar graph in which all but exactly t numbers of its faces have the same length. It is proved that there is no 2-connected 1-nearly platonic graph. In this paper, we prove that there is no 1-nearly platonic graph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.