A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
From MaRDI portal
Publication:1349112
DOI10.1016/S0012-365X(01)00100-5zbMath0993.05056OpenAlexW2055991253MaRDI QIDQ1349112
Brigitte Servatius, Herman J. Servatius
Publication date: 21 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00100-5
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
This page was built for publication: A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
