Plane graphs with Eulerian Petrie walks

Authors:
Arjana Zitnik
Affiliations:
Department of Mathematics, University of Ljubljana, Jadranska 19, 1111 Ljubljana, Slovenia
Venue:
Discrete Mathematics - Algebraic and topological methods in graph theory
Year:
2002

Citing 5
Cited 1

On face vectors and vertex vectors of convex polyhedra

Discrete Mathematics
Realizations with a cut-through Eulerian circuit

Discrete Mathematics
Dual Eulerian Properties of Plane Multigraphs

SIAM Journal on Discrete Mathematics
The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

On plane graphs with link component number equal to the nullity

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

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. We give a characterization of 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 whether or not there exist 4-valent plane graphs with Eulerian Petrie walks and faces of prescribed sizes.