The Common Structure of the Curves Having a Same Gauss Word

DOI10.1007/978-3-319-09039-9_1zbMath1328.68155OpenAlexW169604172MaRDI QIDQ4982988

No author found.

Publication date: 14 April 2015

Published in: Automata, Universality, Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09039-9_1

Mathematics Subject Classification ID

Combinatorics on words (68R15) General low-dimensional topology (57M99)

Cites Work

• A simple 3-edge-connected component algorithm
• The Gauss code problem off the plane
• On a characterization of Gauss codes
• Ribbon plumbing and the problem of Gauss words
• The monadic second-order logic of graphs. XII: Planar graphs and planar maps
• Map genus, forbidden maps, and monadic second-order logic
• Maintaining the 3-Edge-Connected Components of a Graph On-Line
• A forbidden substructure characterization of Gauss codes
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• A Fast Algorithm for Optimally Increasing the Edge Connectivity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Common Structure of the Curves Having a Same Gauss Word