A note on 3-connected cubic planar graphs
type: Item
instance of: scholarly article
title: A note on 3-connected cubic planar graphs
zbMATH Open document ID: 1222.05122
published in: Discrete Mathematics
publication date: 2010-05-28T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 5713532
zbMATH Keywords: longest cycle
zbMATH Keywords: 3-connected cubic planar graph
zbMATH Keywords: Hamilton cycle
zbMATH Keywords: Hamiltonian
zbMATH Keywords: non-Hamiltonian
zbMATH Keywords: Tutte fragment
author: Xiaoyun Lu
MaRDI profile type: Publication
full work available at URL: j.disc.2010.03.010
OpenAlex ID: W2033879878
cites work: Q5422499
cites work: Long cycles in 3-connected graphs
cites work: The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
cites work: Simple paths on polyhedra
cites work: On Hamiltonian Circuits
cites work: A Theorem on Planar Graphs
cites work: Q4389325
DOI: 10.1016/J.DISC.2010.03.010
description: scientific article; zbMATH DE number 5713532