Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant

DOI10.2140/agt.2024.24.555arXiv2101.05740MaRDI QIDQ6122324

Elena Pavelescu, Andrei Pavelescu

Publication date: 5 April 2024

Published in: Algebraic \& Geometric Topology (Search for Journal in Brave)

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

zbMATH Keywords

Colin de Verdière invariantintrinsically linked graphintrinsically knotted graphnonseparating planar graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs of 20 edges are 2-apex, hence unknotted
• The Colin de Verdière number and sphere representations of a graph
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Non-separating planar graphs
• Many, many more intrinsically knotted graphs
• The Y-triangle move does not preserve intrinsic knottedness
• Homomorphiesätze für Graphen
• Knots and links in spatial graphs
• Intrinsically knotted graphs
• A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
• A newly recognized intrinsically knotted graph
• Linkless embeddings of graphs in 3-space
• Knots, Links, Spatial Graphs, and Algebraic Invariants
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• Every planar graph with nine points has a nonplanar complement
• Realization of knots and links in a spatial graph
• On the number of edges in maximally linkless graphs
• Maximal knotless graphs
• New bounds on maximal linkless graphs

This page was built for publication: Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant