linklessly embeddable graph
graph that can be embedded in ℝ³ without nontrivial links
Facts
3 properties- Instance of
- minor-closed graph class
- Subclass of
- undirected graph[2]
- Has characteristic
- linkless embedding, Colin de Verdière graph invariant, Hadwiger number[3][4][5]
🏷️ Also known as
en linklessly embeddable graph
en not intrinsically linked graph
he גרף הניתן להטמעה ללא קישורים
he גרף לא מקושר מהותית
he גרף לא קשור באופן מהותי
he גרף ניתן להטמעה ללא קישור
🔖 Identifiers · 2
- MathWorld ID
- LinklesslyEmbeddableGraph
- Wolfram Language entity code
- Entity["GraphClass", "LinklesslyEmbeddable"]
Press Enter · cited answer in seconds
0 sources
Summary
linklessly embeddable graph is a minor-closed graph class[1].