Linkless embedding
id:
linkless-embedding-242-11016197
title:
Linkless embedding
text:
In topological graph theory, a mathematical discipline, a linkless embedding of an undirected graph is an embedding of the graph into three-dimensional Euclidean space in such a way that no two cycles of the graph are linked. A flat embedding is an embedding with the property that every cycle is the boundary of a topological disk whose interior is disjoint from the graph. A linklessly embeddable graph is a graph that has a linkless or flat embedding; these graphs form a three-dimensional analogu
brand slug:
wiki
category slug:
encyclopedia
description:
Embedding a graph in 3D space with no cycles interlinked
original url:
https://en.wikipedia.org/wiki/Linkless_embedding
date created:
date modified:
2024-02-19T20:06:59Z
main entity:
{"identifier":"Q6554389","url":"https://www.wikidata.org/entity/Q6554389"}
image:
fields total:
13
integrity:
14