\(W_ v\) cycles in plane graphs (Q1900043)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(W_ v\) cycles in plane graphs |
scientific article |
Statements
\(W_ v\) cycles in plane graphs (English)
0 references
6 December 1995
0 references
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.
0 references
longest cycle
0 references
facial cycle
0 references
plane graph
0 references
cycle
0 references
