An infinite family of linklessly embeddable Tutte-4-connected graphs

DOI10.1007/s00373-022-02497-9zbMath1489.05034arXiv2106.08018MaRDI QIDQ2141339

Elena Pavelescu, Andrei Pavelescu

Publication date: 25 May 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

clique sum; linklessly embeddable graph; Tutte-4-connected graph

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

57M15: Relations of low-dimensional topology with graph theory

05C40: Connectivity

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)