A homological solution for the Gauss code problem in arbitrary surfaces

DOI10.1016/j.jctb.2007.08.007zbMath1170.57002OpenAlexW2088798099MaRDI QIDQ2483476

Valdenberg Silva, Sóstenes Lins, Emerson Oliveira-Lima

Publication date: 28 April 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.08.007

zbMATH Keywords

closed surfaces4-regular graphsGauss code problemface colorabilitylacetsmedial maps (of graphs on surfaces)

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (7)

From colored triangulations to framed link presentations of 3-manifolds by a polynomial algorithm ⋮ Z-oriented triangulations of surfaces ⋮ Embeddings of 4-valent framed graphs into 2-surfaces ⋮ \(Z\)-knotted and \(Z\)-homogeneous triangulations of surfaces ⋮ \(z\)-knotted triangulations of surfaces ⋮ Connected sums of \(z\)-knotted triangulations ⋮ On two types of \(Z\)-monodromy in triangulations of surfaces

Cites Work

• The Gauss code problem off the plane
• Graph-encoded maps
• An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
• On lacets and their manifolds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A homological solution for the Gauss code problem in arbitrary surfaces