\(W_ v\) cycles in plane graphs
type: Item
instance of: scholarly article
title: \(W_ v\) cycles in plane graphs
zbMATH Open document ID: 0839.05061
DOI: 10.1007/BF01266320
author: Zdzisław Skupień
author: Stanislav Jendroľ
published in: Geometriae Dedicata
publication date: 1995-12-06T00:00:00Z
review text: Given a plane graph \(G\), a \(W_v\) cycle is a cycle which intersects each face of \(G\) in a connected subgraph. If the minimum degree of \(G\) is at least 3 then a \(W_v\) cycle exists and its length is at most the number of faces in \(G\). Extremal classes of graphs are studied.
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 52B05
Mathematics Subject Classification ID: 52B10
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 806237
zbMATH Keywords: longest cycle
zbMATH Keywords: facial cycle
zbMATH Keywords: plane graph
zbMATH Keywords: cycle
MaRDI profile type: Publication
cites work: Wv paths on 3-polytopes
cites work: Q3856794
cites work: \(W_ v\) paths in the projective plane
cites work: Lengths of cycles in halin graphs
cites work: Q5547252
cites work: Shortness exponents of families of graphs
cites work: Paths on Polyhedra. I
cites work: Q5572939
cites work: Q3335816
full work available at URL: https://doi.org/10.1007/bf01266320
OpenAlex ID: W2065738542
description: scientific article; zbMATH DE number 806237