2003/12/09 by Thomas W. Mattman, Mattman, Thomas W., Ryan Ottman +3
Computer Science · Engineering · Mathematics · #05C10 (Primary) 57M15 (Secondary) #Advanced Graph Theory Research #FOS: Mathematics #Geometric Topology (math.GT) #Graph Labeling and Dimension Problems #graph theory and CDMA systems #math.GT #msc:05C10 #msc:57M15
paper · pdf · doi:10.48550/arxiv.math/0312176
v2: 20 pages, 10 figures, substantial expansion of version 1
openalex publication_date 2003/12/09 · arxiv created 2004/08/21 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families, we verify a conjecture presented in Adams' "The Knot Book": If a vertex is removed from an intrinsically knotted graph, one obtains an intrinsically linked graph.