# Structure and Enumeration of $K4$-minor-free links and link diagrams

3 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We study the class L of link types that admit a K 4-minor-free diagram, i.e., they can be projected on the plane so that the resulting graph does not contain any subdivision of K 4. We prove that L is the closure of a subclass of torus links under the operation of connected sum. Using this structural result, we enumerate L and subclasses of it, with respect to the minimal number of crossings or edges in a projection of L ∈ L. Further, we enumerate (both exactly and asymptotically) all connected K 4-minor-free link diagrams, all minimal connected K 4-minor-free link diagrams, and all K 4-minor-free diagrams of the unknot.
Keywords :
Document type :
Journal articles
Domain :
Complete list of metadata

Cited literature [10 references]

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01890505
Contributor : Dimitrios Thilikos <>
Submitted on : Monday, October 8, 2018 - 4:33:48 PM
Last modification on : Saturday, December 26, 2020 - 1:46:07 PM
Long-term archiving on: : Wednesday, January 9, 2019 - 4:36:54 PM

### File

spknots_DMC.pdf
Files produced by the author(s)

### Citation

Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona. Structure and Enumeration of $K4$-minor-free links and link diagrams. Electronic Notes in Discrete Mathematics, Elsevier, 2018, 68, pp.119-124. ⟨10.1016/j.endm.2018.06.021⟩. ⟨lirmm-01890505⟩

Record views