A newly recognized intrinsically knotted graph
From MaRDI portal
Publication:4416304
DOI10.1002/jgt.10114zbMath1022.05019OpenAlexW4254843652WikidataQ56431014 ScholiaQ56431014MaRDI QIDQ4416304
Publication date: 31 July 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10114
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items (15)
INTRINSICALLY LINKED GRAPHS WITH KNOTTED COMPONENTS ⋮ Intrinsic linking and knotting of graphs in arbitrary 3-manifolds ⋮ The minor minimal intrinsically chiral graphs ⋮ Some recent progress and applications in graph minor theory ⋮ TRIANGLE-Y EXCHANGES ON INTRINSIC KNOTTING OF ALMOST COMPLETE AND COMPLETE PARTITE GRAPHS ⋮ Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant ⋮ Counting links and knots in complete graphs ⋮ SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS ⋮ Many, many more intrinsically knotted graphs ⋮ Recent developments in spatial graph theory ⋮ Intrinsic linking and knotting in virtual spatial graphs ⋮ An Algorithm for Detecting Intrinsically Knotted Graphs ⋮ INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES ⋮ LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K7 ⋮ Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph
Cites Work
This page was built for publication: A newly recognized intrinsically knotted graph
