Planar doodles: their properties, codes and classification

DOI10.1142/S0218216524500226MaRDI QIDQ6629550FDOQ6629550

Authors Andrew Bartholomew, Roger Andrew Fenn 

Publication date 30 October 2024

Published in Journal of Knot Theory and its Ramifications (Search for Journal in Brave)

zbMATH Keywords

dual graphsHamiltonian circuitsconnectivity conditionsgeneralized knotsdoodle tablesplanar doodlesplanarity conditions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Planar graphs; geometric and topological aspects of graph theory (05C10) Other designs, configurations (05B30) Relations of low-dimensional topology with graph theory (57M15) Knot theory (57K10)

Recommendations

• Doodle groups
• Doodles on surfaces
• Doodles and commutator identities
• Vassiliev invariants classify plane curves and doodles
• Colorings and doubled colorings of virtual doodles

Cites Work

• scientific article; zbMATH DE number 3636932 (Why is no real title available?)
• A Theorem on Planar Graphs
• Alexander and Markov theorems for generalized knots, II generalized braids
• Doodle groups
• Doodles on surfaces
• On Gauss codes of virtual doodles
• On Hamiltonian Circuits
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Weyl algebras and knots

This page was built for publication: Planar doodles: their properties, codes and classification

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