The complement problem for linklessly embeddable graphs

DOI10.1142/S0218216522500754MaRDI QIDQ5050621

Elena Pavelescu, Andrei Pavelescu, Ryan Odeneal, Ramin Naimi

Publication date: 17 November 2022

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

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

zbMATH Keywords

spatial graphgraph complementlinklessly embeddablede Verdière invariant

Mathematics Subject Classification ID

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

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• A graph and its complement with specified properties. III: Girth and circumference
• A graph and its complement with specified properties. I: Connectivity
• The Colin de Verdière number and sphere representations of a graph
• A splitter for graphs with no Petersen family minor
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• The complement of a nIL graph with thirteen vertices is IL
• Practical graph isomorphism. II.
• Homomorphiesätze für Graphen
• Nordhaus-Gaddum problems for Colin de Verdière type parameters, variants of tree-width, and related parameters
• Knots and links in spatial graphs
• A graph and its complement with specified properties. IV. Counting self-complementary blocks
• A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
• Linkless embeddings of graphs in 3-space
• Most graphs are knotted
• Generation of Triangulations of the Sphere
• The Non-Biplanar Character of the Complete 9-Graph
• Every planar graph with nine points has a nonplanar complement
• On the number of edges in maximally linkless graphs

This page was built for publication: The complement problem for linklessly embeddable graphs