Linearly free graphs
From MaRDI portal
Publication:6057892
DOI10.1002/jgt.22783arXiv2206.11449OpenAlexW4200622296MaRDI QIDQ6057892
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.11449
Structural characterization of families of graphs (05C75) Relations of low-dimensional topology with graph theory (57M15) Knot theory (57K10)
Cites Work
- On intrinsically knotted or completely 3-linked graphs
- Exactly fourteen intrinsically knotted graphs have 21 edges
- On primitive sets of loops in the boundary of a handlebody
- Detecting unknotted graphs in 3-space
- On planarity of graphs in 3-manifolds
- Sachs' linkless embedding conjecture
- Linearly embedded graphs in 3-space with homotopically free exteriors
- Many, many more intrinsically knotted graphs
- Knots and links in spatial graphs
- More intrinsically knotted graphs
- Intrinsic linking and knotting are arbitrarily complex
- Intrinsically knotted graphs
- Color Invariant for Spatial Graphs
- Bipartite Intrinsically Knotted Graphs with 22 Edges
- An Algorithm for Detecting Intrinsically Knotted Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linearly free graphs