1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.CO2019★ 1 cited
2-nearly Platonic graphs are unique
D. Froncek, M. R. Khorsandi, S. R. Musawi +1
A 2-nearly Platonic graph of type (k|d) is a k-regular planar graph with f faces, f-2 of which are of degree d and the remaining two are of degrees m_1;m_2, both different from d.…
math.CO2019
A note on nearly Platonic graphs with connectivity one
D. Froncek, M. R. Khorsandi, S. R. Musawi +1
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 conn…