Search Results - "Odeneal, Ryan"

The Structure of Kn-Free Graphs by Odeneal, Ryan A

“…Simple graphs are well known structures with a wide range of applications infields like Computer Science. One graph is said to be the minor of another if by a…”
Get full text

Simple Graphs of Order 12 and Minimum Degree 6 Contain K_6 Minors by Odeneal, Ryan, Pavelescu, Andrei

“…Involve 13 (2020) 829-843 We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor…”
Get full text

The Complement Problem for Linklessly Embeddable Graphs by Naimi, Ramin, Odeneal, Ryan, Pavelescu, Andrei, Pavelescu, Elena

“…We find all maximal linklessly embeddable graphs of order up to 11, and verify that for every graph $G$ of order 11 either $G$ or its complement $cG$ is…”
Get full text