Structure and enumeration of K₄-minor-free links and link-diagrams
From MaRDI portal
Publication:2198981
DOI10.1016/J.EJC.2020.103147zbMATH Open1448.57028OpenAlexW3025873433MaRDI QIDQ2198981FDOQ2198981
Authors: Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona 
Publication date: 15 September 2020
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2020.103147
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
Enumeration in graph theory (05C30) Graph minors (05C83) Relations of low-dimensional topology with graph theory (57M15)
Cites Work
- Analytic combinatorics
- Enumeration and limit laws for series-parallel graphs
- Title not available (Why is that?)
- Graph Classes: A Survey
- A partial k-arboretum of graphs with bounded treewidth
- Title not available (Why is that?)
- Title not available (Why is that?)
- Invariants of random knots and links
- RANDOM KNOTS AND ENERGY: ELEMENTARY CONSIDERATIONS
- Title not available (Why is that?)
- Knot projections with a single multi-crossing
- Almost all maps are asymmetric
- THE ADDITIVITY OF CROSSING NUMBERS
- Submaps of maps. I: General 0-1 laws
- The rate of growth of the number of prime alternating links and tangles
- Untangling planar curves
- Title not available (Why is that?)
- Enumeration of labelled 4-regular planar graphs
- Asymptotic laws for random knot diagrams
- On the number of unknot diagrams
Cited In (1)
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)
