Structure and enumeration of K₄-minor-free links and link-diagrams
From MaRDI portal
Publication:2198981
Recommendations
- Structure and enumeration of \(K_{4}\)-minor-free links and link diagrams
- Counting links and knots in complete graphs
- Framed 4-valent graph minor theory. I: Introduction. A planarity criterion and linkless embeddability
- Excluded minors and the ribbon graphs of knots
- Classification of links of small complexity in the thickened torus
Cites work
- scientific article; zbMATH DE number 986989 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 2120368 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 2209170 (Why is no real title available?)
- A partial k-arboretum of graphs with bounded treewidth
- Almost all maps are asymmetric
- Analytic combinatorics
- Asymptotic laws for random knot diagrams
- Enumeration and limit laws for series-parallel graphs
- Enumeration of labelled 4-regular planar graphs
- Graph Classes: A Survey
- Invariants of random knots and links
- Knot projections with a single multi-crossing
- On the number of unknot diagrams
- RANDOM KNOTS AND ENERGY: ELEMENTARY CONSIDERATIONS
- Submaps of maps. I: General 0-1 laws
- THE ADDITIVITY OF CROSSING NUMBERS
- The rate of growth of the number of prime alternating links and tangles
- Untangling planar curves
This page was built for publication: Structure and enumeration of \(K_4\)-minor-free links and link-diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198981)