DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Linkless embedding
Linkless embedding
Intrinsic Linking and Knotting of Graphs in Arbitrary 3–Manifolds 1 Introduction
On a Conjecture Concerning the Petersen Graph
Knots, Links, Spatial Graphs, and Algebraic Invariants
Simple Treewidth Kolja Knauer 1 1 Introduction
When Graph Theory Meets Knot Theory
On Intrinsically Knotted and Linked Graphs
Computing Linkless and Flat Embeddings of Graphs in R3
Three-Dimensional Drawings
Defective and Clustered Graph Colouring∗
Intrinsic Linking and Knotting of Graphs in Arbitrary 3–Manifolds Erica Flapan Pomona College
Problems on Low-Dimensional Topology, 2012
The Colin De Verdi`Ere Graph Parameter (Preliminary Version, March 1997)
Excluding Two Minors of the Petersen Graph Adam Beau Ferguson Louisiana State University and Agricultural and Mechanical College
BIPARTITE RIGIDITY 1. Introduction 1.1. Three Basic Properties Of
A Borsuk Theorem for Antipodal Links and a Spectral Characterization of Linklessly Embeddable Graphs1 L´Aszl´O Lov´Asz2 and Alexander Schrijver3
COMBINATORICS of EMBEDDINGS 2 Triangulated by a Simplicial Complex K Is Denoted |K|
Bounded Combinatorial Width and Forbidden Substructures
Linkless Embeddings of Graphs in 3-Space
Top View
Arxiv:Math.GT/0604045 V1 3 Apr 2006
Excluded-Minor Characterization of Apex-Outerplanar Graphs" (2011)
MAXIMALLY KNOTLESS GRAPHS a Thesis Presented to the Faculty Of
When Is a Graph Knotted?
Non-Separating Planar Graphs
Forbidden Minors: Finding the Finite Few
Linkless and Flat Embeddings in 3-Space in Quadratic Time
Combinatorial Restrictions on Cell Complexes
The Extremal Function and Colin De Verdi`Ere Graph Parameter
Problems on Low-Dimensional Topology, 2012
Graph Planarity and Related Topics
Graph Minors
12 Graph Minors
What Is...A Graph Minor, Volume 53, Number 3
Algorithmic Graph Structure Theory
Intrinsic Linking and Knotting of Graphs Kenji Kozai Harvey Mudd College
GRAPH MINOR THEORY 1. Introduction Let Us Start with Recalling Kuratowski's Theorem
International Workshop of Knots and Links in a Spatial Graph Program and Abstracts