Pages that link to "Item:Q1597785"
From MaRDI portal
The following pages link to Intrinsic knotting and linking of complete graphs (Q1597785):
Displaying 24 items.
- Knots in the canonical book representation of complete graphs (Q365957) (← links)
- Intrinsically \(n\)-linked complete graphs (Q841443) (← links)
- Intrinsic linking and knotting of graphs in arbitrary 3-manifolds (Q863049) (← links)
- A graph-theoretic approach to a partial order of knots and links (Q960836) (← links)
- Counting links in complete graphs (Q1012051) (← links)
- Knots in certain spatial graphs (Q1118860) (← links)
- Knots and links in certain spatial complete graphs (Q1924155) (← links)
- Some Ramsey-type results on intrinsic linking of \(n\)-complexes (Q1954154) (← links)
- Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs (Q2033480) (← links)
- Weakly linked embeddings of pairs of complete graphs in \(\mathbb{R}^3\) (Q2138585) (← links)
- Generalizations of the Conway-Gordon theorems and intrinsic knotting on complete graphs (Q2302628) (← links)
- Counting links and knots in complete graphs (Q2444958) (← links)
- Intrinsically linked graphs and even linking number (Q2571389) (← links)
- Knots and links in spatial graphs: a survey (Q2575796) (← links)
- Intrinsically linked graphs with knotted components (Q2881366) (← links)
- Every graph has an embedding in 𝑆³ containing no non-hyperbolic knot (Q3648189) (← links)
- Intrinsically knotted graphs (Q3651177) (← links)
- Entanglement complexity of graphs in <i>Z</i><sup>3</sup> (Q3994049) (← links)
- A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT (Q4474531) (← links)
- Intrinsically knotted and 4-linked directed graphs (Q4565307) (← links)
- Intrinsic linking and knotting are arbitrarily complex in directed graphs (Q5035316) (← links)
- Intrinsic linking with linking numbers of specified divisibility (Q5225043) (← links)
- SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS (Q5386832) (← links)
- Linking number of monotonic cycles in random book embeddings of complete graphs (Q6167122) (← links)
