BibTeX
@MISC{Nickolaus_intrinsicallylinked,
author = {Cara Nickolaus and Justin Raimondi and Joshua Wilson and Liang Zhang},
title = {INTRINSICALLY LINKED GRAPHS},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. A graph is intrinsically linked if every embedding of the graph contains some pair of cycles that form a non-split link. Robertson, Seymour, and Thomas originally proved the minor-minimal set of intrinsically linked graphs to be the Petersen Family Graphs in 1995. We seek strategies to reprove this result in a simpler way by defining new concepts such as weak flexible planarity and flatness and by exploring the conflict graphs of maximally planar subgraphs, analogous to Tutte’s work with conflict graphs associated to cycles. We also discuss results regarding intrinsic linking of the join of a graph and two disjoint vertices. I.
