A note on nearly Platonic graphs with connectivity one

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...

Volledige beschrijving

Bewaard in:
Bibliografische gegevens
Hoofdauteurs: Froncek, Dalibor; Department of Mathematics and Statistics, University of Minnesota Duluth, Duluth, Minnesota 55812, U.S.A (Auteur), Khorsandi, Mahdi Reza; Faculty of Mathematical Sciences, Shahrood University of Technology, P.O. Box 6199-95161, Shahrood, Iran (Auteur), Musawi, Seyed Reza; Faculty of Mathematical Sciences, Shahrood University of Technology, P.O. Box 6199-95161, Shahrood, Iran (Auteur), Qiu, Jiangyi; Department of Mathematics and Statistics, University of Massachusetts Amherst, Amherst, MA 1003-9305, U.S.A (Auteur)
Formaat: EJournal Article
Gepubliceerd in: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2021-04-15.
Onderwerpen:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online toegang:Get Fulltext
Tags: Voeg label toe
Geen labels, Wees de eerste die dit record labelt!

Internet

Get Fulltext

3rd Floor Main Library

Exemplaargegevens van 3rd Floor Main Library
Plaatsingsnummer: A1234.567
Kopie 1 Beschikbaar

Gelijkaardige items