linklessly embeddable graph
graph that can be embedded in ℝ³ without nontrivial links
Press Enter · cited answer in seconds
0 sources
linklessly embeddable graph
Summary
linklessly embeddable graph is a minor-closed graph class[1].
Key Facts
- linklessly embeddable graph's instance of is recorded as minor-closed graph class[2].
- linklessly embeddable graph's subclass of is recorded as undirected graph[3].
- linklessly embeddable graph's has characteristic is recorded as linkless embedding[4].
- linklessly embeddable graph's has characteristic is recorded as Colin de Verdière graph invariant[5].
- linklessly embeddable graph's has characteristic is recorded as Hadwiger number[6].
- linklessly embeddable graph's MathWorld ID is recorded as LinklesslyEmbeddableGraph[7].
- linklessly embeddable graph's Wolfram Language entity code is recorded as Entity["GraphClass", "LinklesslyEmbeddable"][8].
- linklessly embeddable graph's maintained by WikiProject is recorded as WikiProject Mathematics[9].