A homological solution for the Gauss code problem in arbitrary surfaces

DOI10.1016/J.JCTB.2007.08.007MaRDI QIDQ2483476zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• The Gauss code problem off the plane
• scientific article; zbMATH DE number 7274002
• On a characterization of Gauss codes
• A new proof of the Gauss interlace conjecture
• scientific article; zbMATH DE number 3557793

Cites work

• Q2716030 scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• Q3923266 scientific article; zbMATH DE number 3736614 (Why is no real title available?)
• Q4017148 scientific article; zbMATH DE number 91007 (Why is no real title available?)
• Q4063182 scientific article; zbMATH DE number 3480634 (Why is no real title available?)
• Q4111590 scientific article; zbMATH DE number 3536116 (Why is no real title available?)
• Q4113873 scientific article; zbMATH DE number 3537726 (Why is no real title available?)
• Q4126360 scientific article; zbMATH DE number 3552535 (Why is no real title available?)
• Q4150353 scientific article; zbMATH DE number 3579615 (Why is no real title available?)
• Q5580249 scientific article; zbMATH DE number 3297105 (Why is no real title available?)
• An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
• Graph theory with applications Graph theory with applications
• Graph-encoded maps Graph-encoded maps
• Graphs on surfaces Graphs on surfaces
• On lacets and their manifolds On lacets and their manifolds
• The Gauss code problem off the plane The Gauss code problem off the plane

Cited in

(14)

• The Gauss code problem off the plane
• \(Z\)-knotted and \(Z\)-homogeneous triangulations of surfaces
• On lacets and their manifolds
• \(Z\)-oriented triangulations of surfaces
• On \(z\)-monodromies in embedded graphs
• Embeddings of 4-valent framed graphs into 2-surfaces
• Zigzags in combinatorial tetrahedral chains and the associated Markov chain
• Connected sums of \(z\)-knotted triangulations
• From colored triangulations to framed link presentations of 3-manifolds by a polynomial algorithm
• On two types of \(Z\)-monodromy in triangulations of surfaces
• scientific article; zbMATH DE number 2116354 (Why is no real title available?)
• Calculating colored homflypt invariants with image processing and a new form of Gauss code
• \(z\)-knotted triangulations of surfaces
• Colored Gauss and tangent codes on the torus

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

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