Intrinsically \(n\)-linked complete graphs

DOI10.3836/tjm/1249648413zbMath1184.05026OpenAlexW2042349413MaRDI QIDQ841443

Danielle O'Donnol, Gabriel C. Drummond-Cole

Publication date: 16 September 2009

Published in: Tokyo Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3836/tjm/1249648413

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Connectivity (05C40)

Related Items (1)

Weakly linked embeddings of pairs of complete graphs in \(\mathbb{R}^3\)

Cites Work

• Sachs' linkless embedding conjecture
• Knots and links in spatial graphs
• INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS
• INTRINSICALLY n-LINKED GRAPHS
• SOME NEW INTRINSICALLY 3-LINKED GRAPHS
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• Intrinsically triple linked complete graphs
• Unnamed Item

This page was built for publication: Intrinsically \(n\)-linked complete graphs