INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS

DOI10.1142/S0218216508006014zbMath1149.57308arXivmath/0512205MaRDI QIDQ3519627

Danielle O'Donnol

Publication date: 19 August 2008

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0512205

zbMATH Keywords

bipartite graphsspatial graphsembedded graphsintrinsic linking

Mathematics Subject Classification ID

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

Related Items (3)

Intrinsically \(n\)-linked complete graphs ⋮ Intrinsically linked graphs in projective space ⋮ PLANE CURVES IN AN IMMERSED GRAPH IN ℝ²

Cites Work

• Sachs' linkless embedding conjecture
• Knots and links in spatial graphs
• INTRINSICALLY n-LINKED GRAPHS
• SOME NEW INTRINSICALLY 3-LINKED GRAPHS
• Intrinsically triple linked complete graphs

This page was built for publication: INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS