5 papers
An infinite family of linklessly embeddable Tutte-4-connected graphs
Andrei Pavelescu, Elena Pavelescu
For each , we provide an example of a linklessly embeddable, Tutte-4-connected graph of order .
Simple Graphs of Order 12 and Minimum Degree 6 Contain K_6 Minors
Ryan Odeneal, Andrei Pavelescu
We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.
The complement of a nIL graph with thirteen vertices is IL
Andrei Pavelescu, Elena Pavelescu
We show that for any simple non-oriented graph G with at least thirteen vertices either G or its complement is intrinsically linked.
Escher squares and lattice links
Ramin Naimi, Andrei Pavelescu, Elena Pavelescu
We give a shorter and simpler proof of the result of [2], which gives a necessary and sufficient condition for when a lattice diagram is the projection of a lattice link.
Hadwiger numbers of self-complementary graphs
Andrei Pavelescu, Elena Pavelescu
The Hadwiger number of a graph , denoted by , is the order of the largest complete minor of . A graph is said to be self-complementary if it is isomorphic to its comple…