Cycles in 4-connected planar graphs
type: Item
instance of: scholarly article
title: Cycles in 4-connected planar graphs
zbMATH Open document ID: 1050.05032
author: Xingxing Yu
author: Guantao Chen
author: Genghua Fan
published in: European Journal of Combinatorics
publication date: 2004-10-04T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 2105713
zbMATH Keywords: cycle
zbMATH Keywords: Tutte paths
zbMATH Keywords: conjecture of Malkevitch
MaRDI profile type: Publication
full work available at URL: j.ejc.2003.04.003
OpenAlex ID: W1988068505
cites work: The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
cites work: Q3834063
cites work: Uncontractable 4-connected graphs
cites work: Q4044482
cites work: Q3129827
cites work: 4-connected projective planar graphs are Hamiltonian
cites work: A theorem on paths in planar graphs
cites work: A Theorem on Planar Graphs
cites work: How to Draw a Graph
DOI: 10.1016/J.EJC.2003.04.003
description: scientific article; zbMATH DE number 2105713