Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Linkless_embedding> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Linkless_embedding abstract "In topological graph theory, a mathematical discipline, a linkless embedding of an undirected graph is an embedding of the graph into Euclidean space in such a way that no two cycles of the graph have nonzero linking number. 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 analogue of the planar graphs. Complementarily, an intrinsically linked graph is a graph that does not have a linkless embedding.Flat embeddings are automatically linkless, but not vice versa. The complete graph K6, the Petersen graph, and the other five graphs in the Petersen family do not have linkless embeddings. The linklessly embeddable graphs are closed under graph minors and Y-Δ transforms, have the Petersen family graphs as their forbidden minors, and include the planar graphs and apex graphs. They may be recognized, and a flat embedding may be constructed for them, in linear time.".
- Linkless_embedding thumbnail Hopf_Link.png?width=300.
- Linkless_embedding wikiPageExternalLink 106404.
- Linkless_embedding wikiPageExternalLink I3L.pdf.
- Linkless_embedding wikiPageExternalLink hadwiger.pdf.
- Linkless_embedding wikiPageExternalLink linklsurvey.pdf.
- Linkless_embedding wikiPageExternalLink matroiddecompositionbook.pdf.
- Linkless_embedding wikiPageID "772031".
- Linkless_embedding wikiPageRevisionID "600175752".
- Linkless_embedding authorlink "Horst Sachs".
- Linkless_embedding first "Horst".
- Linkless_embedding hasPhotoCollection Linkless_embedding.
- Linkless_embedding last "Sachs".
- Linkless_embedding year "1983".
- Linkless_embedding subject Category:Graph_minor_theory.
- Linkless_embedding subject Category:Knot_theory.
- Linkless_embedding subject Category:Topological_graph_theory.
- Linkless_embedding comment "In topological graph theory, a mathematical discipline, a linkless embedding of an undirected graph is an embedding of the graph into Euclidean space in such a way that no two cycles of the graph have nonzero linking number. 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.".
- Linkless_embedding label "Linkless embedding".
- Linkless_embedding sameAs m.0cnzw77.
- Linkless_embedding sameAs Q6554389.
- Linkless_embedding sameAs Q6554389.
- Linkless_embedding wasDerivedFrom Linkless_embedding?oldid=600175752.
- Linkless_embedding depiction Hopf_Link.png.
- Linkless_embedding isPrimaryTopicOf Linkless_embedding.