A note on nearly Platonic graphs with connectivity one
Work
Year: 2021
Type: article
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 ex... more
Institutions University of Minnesota, Duluth, University of Shahrood, University of Massachusetts Amherst
Cites: 5
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond