Planar doodles: their properties, codes and classification
DOI10.1142/S0218216524500226MaRDI QIDQ6629550
Andrew Bartholomew, Roger Andrew Fenn
Publication date: 30 October 2024
Published in: Journal of Knot Theory and its Ramifications (Search for Journal in Brave)
Hamiltonian circuitsdual graphsconnectivity conditionsgeneralized knotsdoodle tablesplanar doodlesplanarity conditions
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)
Cites Work
- Title not available (Why is that?)
- Weyl algebras and knots
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
- A Theorem on Planar Graphs
- Doodle groups
- Doodles on surfaces
- On gauss codes of virtual doodles
- Alexander and Markov theorems for generalized knots, II generalized braids
- On Hamiltonian Circuits
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)
