Coding sequences and Euler's formula for graphs on surfaces

MaRDI QIDQ5443262zbMATH OpenFDO

Authors Siemion Fajtlowicz, Eunjeong Yi

Publication date 20 February 2008

zbMATH Keywords

embeddingcompact surfacesEulerian toursGraffitiplanar Eulerian graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Graphs 2-cell embedded in non-orientable surfaces and their coding sequences
• An application of coding theory to a problem in graphical enumeration
• Graphs of spheres and tori
• Three new proofs of Euler's characteristic formula
• The Gauss code problem off the plane

Cited in

(5)

• An application of coding theory to a problem in graphical enumeration
• Schnyder woods for higher genus triangulated surfaces, with applications to encoding
• On the simplicity of the coded path of the code \((i)\)
• Graphs 2-cell embedded in non-orientable surfaces and their coding sequences
• Three new proofs of Euler's characteristic formula

This page was built for publication: Coding sequences and Euler's formula for graphs on surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443262)