A note on nearly Platonic graphs with connectivity one
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 n...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | EJournal Article |
| 出版: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-04-15.
|
| 主题: | |
| 在线阅读: | Get Fulltext |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|