Plane graphs with Eulerian Petrie walks (Q1349119): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q582576 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Stanlislav Jendroľ / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(01)00061-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2113025160 / rank | |||
Normal rank | |||
Latest revision as of 10:45, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Plane graphs with Eulerian Petrie walks |
scientific article |
Statements
Plane graphs with Eulerian Petrie walks (English)
0 references
21 May 2002
0 references
A Petrie walk in a plane graph \(G\) is obtained by walking on edges of \(G\), alternatingly selecting as next edge the left edge and the right edge of the current edge in the rotation of edges around the common vertex. The author characterizes 4-valent plane graphs with Eulerian Petrie walks, which gives rise to a simple algorithm for constructing such graphs. This algorithm is then used to answer the question of Eberhard's type whether or not there exist 4-valent plane graphs with Eulerian Petrie walks and faces of prescribed sizes.
0 references
Petrie walks
0 references
4-valent plane graphs
0 references
Eberhard-type problem
0 references
